# Hexadecagonal number

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

## Recommended Posts:

- Centered Hexadecagonal Number
- Count number of triplets with product equal to given number with duplicates allowed | Set-2
- Count number of triplets with product equal to given number with duplicates allowed
- Find minimum number to be divided to make a number a perfect square
- Find maximum number that can be formed using digits of a given number
- Program to Convert Octal Number to Binary Number
- Check if a number is divisible by all prime divisors of another number
- Find count of digits in a number that divide the number
- Querying maximum number of divisors that a number in a given range has
- Count number of digits after decimal on dividing a number
- Find the smallest number whose digits multiply to a given number n
- Count number of ways to divide a number in 4 parts
- Build Lowest Number by Removing n digits from a given number
- Print a number strictly less than a given number such that all its digits are distinct.
- Represent a number as a sum of maximum possible number of Prime Numbers

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.