Given a number n, the task is to find the nth hexadecagonal number.

A Hexadecagonal number is class of figurate number and a perfect squares. It has sixteen sided polygon called hexadecagon or hexakaidecagon. The n-th hexadecagonal number count’s the sixteen number of dots and all others dots are surrounding to its successive layer.

**Examples :**

Input : 2

Output :16Input :7

Output :301

Formula to calculate hexadecagonal number:

## C++

`// C++ program to find Nth ` `// hexadecagon number ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to calculate hexadecagonal number ` `int` `hexadecagonalNum(` `long` `int` `n) ` `{ ` ` ` `return` `((14 * n * n) - 12 * n) / 2; ` `} ` ` ` `// Drivers Code ` `int` `main() ` `{ ` ` ` `long` `int` `n = 5; ` ` ` `cout << n << ` `"th Hexadecagonal number : "` `; ` ` ` `cout << hexadecagonalNum(n); ` ` ` `cout << endl; ` ` ` `n = 9; ` ` ` `cout << n << ` `"th Hexadecagonal number : "` `; ` ` ` `cout << hexadecagonalNum(n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find Nth hexadecagon ` `// number ` `import` `java.io.*; ` ` ` `class` `GFG { ` ` ` ` ` `// Function to calculate hexadecagonal ` ` ` `// number ` ` ` `static` `long` `hexadecagonalNum(` `long` `n) ` ` ` `{ ` ` ` `return` `((` `14` `* n * n) - ` `12` `* n) / ` `2` `; ` ` ` `} ` ` ` ` ` `// Drivers Code ` ` ` `public` `static` `void` `main (String[] args) ` ` ` `{ ` ` ` `long` `n = ` `5` `; ` ` ` `System.out.println( n + ` `"th "` ` ` `+ ` `"Hexadecagonal number : "` ` ` `+ hexadecagonalNum(n)); ` ` ` ` ` `n = ` `9` `; ` ` ` `System.out.println( n + ` `"th "` ` ` `+ ` `"Hexadecagonal number : "` ` ` `+ hexadecagonalNum(n)); ` ` ` `} ` `} ` ` ` `// This code contribued by anuj_67. ` |

*chevron_right*

*filter_none*

## Python3

`# Python program to find Nth ` `# hexadecagon number ` ` ` `# Function to calculate ` `# hexadecagonal number ` `def` `hexadecagonalNum(n): ` ` ` ` ` `# Formula to calculate nth ` ` ` `# Centered heptagonal number ` ` ` `return` `((` `14` `*` `n ` `*` `n) ` `-` `12` `*` `n) ` `/` `/` `2` ` ` `# Driver Code ` `n ` `=` `5` `print` `(` `"%sth Hexadecagonal number : "` `%` `n, ` ` ` `hexadecagonalNum(n)) ` `n ` `=` `9` `print` `(` `"%sth Hexadecagonal number : "` `%` `n, ` ` ` `hexadecagonalNum(n)) ` ` ` `# This code is contributed by ajit ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find Nth hexadecagon ` `// number ` `using` `System; ` `class` `GFG { ` ` ` ` ` `// Function to calculate hexadecagonal ` ` ` `// number ` ` ` `static` `long` `hexadecagonalNum(` `long` `n) ` ` ` `{ ` ` ` `return` `((14 * n * n) - 12 * n) / 2; ` ` ` `} ` ` ` ` ` `// Drivers Code ` ` ` `public` `static` `void` `Main () ` ` ` `{ ` ` ` `long` `n = 5; ` ` ` `Console.WriteLine( n + ` `"th "` ` ` `+ ` `"Hexadecagonal number : "` ` ` `+ hexadecagonalNum(n)); ` ` ` ` ` `n = 9; ` ` ` `Console.WriteLine( n + ` `"th "` ` ` `+ ` `"Hexadecagonal number : "` ` ` `+ hexadecagonalNum(n)); ` ` ` `} ` `} ` ` ` `// This code contribued by anuj_67. ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to find Nth ` `// hexadecagon number ` ` ` `// Function to calculate ` `// hexadecagonal number ` ` ` `function` `hexadecagonalNum(` `$n` `) ` `{ ` ` ` `return` `((14 * ` `$n` `* ` `$n` `) - 12 * ` `$n` `) / 2; ` `} ` ` ` `// Driver Code ` `$n` `= 5; ` `echo` `$n` `, ` `"th Hexadecagonal number : "` `; ` `echo` `hexadecagonalNum(` `$n` `); ` `echo` `"\n"` `; ` ` ` `$n` `= 9; ` `echo` `$n` `, ` `"th Hexadecagonal number : "` `; ` `echo` `hexadecagonalNum(` `$n` `); ` ` ` `// This code is contributed bu m_kit ` `?> ` |

*chevron_right*

*filter_none*

**Output :**

5th Hexadecagonal number : 145 9th Hexadecagonal number : 513

Reference: https://en.wikipedia.org/wiki/Polygonal_number

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:

- Centered Hexadecagonal Number
- Program to check if N is a Centered Hexadecagonal Number
- Program to check if N is a Hexadecagonal Number
- Find the sum of the first Nth Centered Hexadecagonal Number
- Number of factors of very large number N modulo M where M is any prime number
- Find minimum number to be divided to make a number a perfect square
- How to check if a given number is Fibonacci number?
- Find the smallest number whose digits multiply to a given number n
- Find n'th number in a number system with only 3 and 4
- Build Lowest Number by Removing n digits from a given number
- Minimum number of squares whose sum equals to given number n
- Count number of subsets of a set with GCD equal to a given number
- Count number of ways to divide a number in 4 parts
- Querying maximum number of divisors that a number in a given range has
- Check if a number is a power of another number
- Find the Largest number with given number of digits and sum of digits
- Finding number of digits in n'th Fibonacci number
- Smallest number by rearranging digits of a given number
- Super Ugly Number (Number whose prime factors are in given set)
- Number with maximum number of prime factors

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.