# Hexacontagon Number

Given a number **N**, the task is to find **N ^{th}** Hexacontagon number.

A Hexacontagon number is class of figurate number. It has 60 – sided polygon called hexacontagon. The N-th hexacontagon number count’s the 60 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first few hexacontagonol numbers are

1, 60, 177, 352 …

**Examples:**

Input:N = 2

Output:60

Explanation:

The second hexacontagonol number is 60.

Input:N = 3

Output:177

**Approach:** The N-th hexacontagon number is given by the formula:

- Nth term of s sided polygon =
- Therefore Nth term of 60 sided polygon is

Below is the implementation of the above approach:

## C++

`// C++ program for above approach ` `#include <iostream> ` `using` `namespace` `std; ` ` ` `// Finding the nth hexacontagon number ` `int` `hexacontagonNum(` `int` `n) ` `{ ` ` ` `return` `(58 * n * n - 56 * n) / 2; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `n = 3; ` ` ` `cout << ` `"3rd hexacontagon Number is = "` ` ` `<< hexacontagonNum(n); ` ` ` ` ` `return` `0; ` `} ` ` ` `// This code is contributed by shubhamsingh10 ` |

*chevron_right*

*filter_none*

## C

`// C program for above approach ` `#include <stdio.h> ` `#include <stdlib.h> ` ` ` `// Finding the nth hexacontagon Number ` `int` `hexacontagonNum(` `int` `n) ` `{ ` ` ` `return` `(58 * n * n - 56 * n) / 2; ` `} ` ` ` `// Driver program to test above function ` `int` `main() ` `{ ` ` ` `int` `n = 3; ` ` ` `printf` `(` `"3rd hexacontagon Number is = %d"` `, ` ` ` `hexacontagonNum(n)); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program for above approach ` `class` `GFG{ ` ` ` `// Finding the nth hexacontagon number ` `public` `static` `int` `hexacontagonNum(` `int` `n) ` `{ ` ` ` `return` `(` `58` `* n * n - ` `56` `* n) / ` `2` `; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `n = ` `3` `; ` ` ` `System.out.println(` `"3rd hexacontagon Number is = "` `+ ` ` ` `hexacontagonNum(n)); ` `} ` `} ` ` ` `// This code is contributed by divyeshrabadiya07 ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program for above approach ` ` ` `# Finding the nth hexacontagon Number ` `def` `hexacontagonNum(n): ` ` ` ` ` `return` `(` `58` `*` `n ` `*` `n ` `-` `56` `*` `n) ` `/` `/` `2` ` ` `# Driver Code ` `n ` `=` `3` `print` `(` `"3rd hexacontagon Number is = "` `, ` ` ` `hexacontagonNum(n)); ` ` ` `# This code is contributed by divyamohan123 ` |

*chevron_right*

*filter_none*

## C#

`// C# program for above approach ` `using` `System; ` ` ` `class` `GFG{ ` ` ` `// Finding the nth hexacontagon number ` `public` `static` `int` `hexacontagonNum(` `int` `n) ` `{ ` ` ` `return` `(58 * n * n - 56 * n) / 2; ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `n = 3; ` ` ` `Console.Write(` `"3rd hexacontagon Number is = "` `+ ` ` ` `hexacontagonNum(n)); ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

**Output:**

3rd hexacontagon Number is = 177

**Reference:** https://en.wikipedia.org/wiki/Hexacontagon

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

## Recommended Posts:

- Number of factors of very large number N modulo M where M is any prime number
- Count number of triplets with product equal to given number with duplicates allowed
- Count number of trailing zeros in Binary representation of a number using Bitset
- Find the largest number smaller than integer N with maximum number of set bits
- Find minimum number to be divided to make a number a perfect square
- Smallest number dividing minimum number of elements in the Array
- Largest number dividing maximum number of elements in the array
- Number of times the largest perfect square number can be subtracted from N
- Smallest number dividing minimum number of elements in the array | Set 2
- Minimum number of swaps required to make a number divisible by 60
- Find the minimum number to be added to N to make it a prime number
- Previous perfect square and cube number smaller than number N
- Given number of matches played, find number of teams in tournament
- Number of possible permutations when absolute difference between number of elements to the right and left are given
- Find smallest possible Number from a given large Number with same count of digits
- Find the number of positive integers less than or equal to N that have an odd number of digits
- Number of ways to split a binary number such that every part is divisible by 2
- Number of distinct ways to represent a number as sum of K unique primes
- Minimum divisor of a number to make the number perfect cube
- Check whether all the rotations of a given number is greater than or equal to the given number or not

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.