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

An Hexacontatetragon number is a class of figurate numbers. It has a 64-sided polygon called Hexacontatetragon. The N-th Hexacontatetragon number count’s the 64 number of dots and all other dots are surrounding with a common sharing corner and make a pattern. The first few Hexacontatetragonol numbers are

1, 64, 189, 376, 625, 936, …

**Examples:**

Input:N = 2

Output:64

Explanation:

The second Hexacontatetragonol number is 64.

Input:N = 3

Output:189

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

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

Below is the implementation of the above approach:

## C++

`// C++ implementation for above approach ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to Find the ` `// Nth Hexacontatetragon Number ` `int` `HexacontatetragonNum(` `int` `n) ` `{ ` ` ` `return` `(62 * n * n - 60 * n) / 2; ` `} ` ` ` `// Driver Code ` `int` `main() ` `{ ` ` ` `int` `n = 3; ` ` ` `cout << HexacontatetragonNum(n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find N-th ` `// Hexacontatetragon number ` `class` `GFG{ ` ` ` `// Function to find the nth ` `// Hexacontatetragon number ` `static` `int` `HexacontatetragonNum(` `int` `n) ` `{ ` ` ` `return` `(` `62` `* n * n - ` `60` `* n) / ` `2` `; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `n = ` `3` `; ` ` ` `System.out.print(HexacontatetragonNum(n)); ` `} ` `} ` ` ` `// This code is contributed by shubham ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation for above approach ` ` ` `# Function to Find the ` `# Nth Hexacontatetragon Number ` `def` `HexacontatetragonNum(n): ` ` ` ` ` `return` `(` `62` `*` `n ` `*` `n ` `-` `60` `*` `n) ` `/` `2` `; ` ` ` `# Driver Code ` `n ` `=` `3` `; ` `print` `(HexacontatetragonNum(n)); ` ` ` `# This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find N-th ` `// Hexacontatetragon number ` `using` `System; ` `class` `GFG{ ` ` ` `// Function to find the nth ` `// Hexacontatetragon number ` `static` `int` `HexacontatetragonNum(` `int` `n) ` `{ ` ` ` `return` `(62 * n * n - 60 * n) / 2; ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `n = 3; ` ` ` `Console.Write(HexacontatetragonNum(n)); ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

**Output:**

189

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

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
- Count numbers which can be constructed using two numbers
- Maximum sum of distinct numbers such that LCM of these numbers is N
- Numbers less than N which are product of exactly two distinct prime numbers
- Print N lines of 4 numbers such that every pair among 4 numbers has a GCD K
- Absolute Difference between the Sum of Non-Prime numbers and Prime numbers of an Array
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
- Count numbers which are divisible by all the numbers from 2 to 10
- Fill the missing numbers in the array of N natural numbers such that arr[i] not equal to i
- Check if a given pair of Numbers are Betrothed numbers or not
- Number of ways to obtain each numbers in range [1, b+c] by adding any two numbers in range [a, b] and [b, c]
- Count of numbers upto M divisible by given Prime Numbers
- Count of N-digit Numbers having Sum of even and odd positioned digits divisible by given numbers
- Maximize count of equal numbers in Array of numbers upto N by replacing pairs with their sum
- Count prime numbers that can be expressed as sum of consecutive prime numbers
- How to swap two numbers without using a temporary variable?
- Lucky Numbers
- Ugly Numbers
- Write a program to add two numbers in base 14
- Count of Binary Digit numbers smaller than N

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.