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

A Hendecagonal number is a figurate number that extends the concept of triangular and square numbers to the decagon (Eleven -sided polygon). The nth hendecagonal number counts the number of dots in a pattern of n nested decagons, all sharing a common corner, where the ith hendecagon in the pattern has sides made of i dots spaced one unit apart from each other.

**Examples:**

Input : 2

Output :11Input :6

Output :141

Formula for nth hendecagonal number :

## C++

`// C++ program to find nth ` `// Hendecagonal number ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find ` `// Hendecagonal number ` `int` `hendecagonal_num(` `int` `n) ` `{ ` ` ` `// Formula to calculate nth ` ` ` `// Hendecagonal number ` ` ` `return` `(9 * n * n - 7 * n) / 2; ` `} ` ` ` `// Driver Code ` `int` `main() ` `{ ` ` ` `int` `n = 3; ` ` ` `cout << n << ` `"rd Hendecagonal number: "` `; ` ` ` `cout << hendecagonal_num(n); ` ` ` `cout << endl; ` ` ` `n = 10; ` ` ` `cout << n << ` `"th Hendecagonal number: "` `; ` ` ` `cout << hendecagonal_num(n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find nth ` `// Hendecagonal number ` `import` `java.io.*; ` ` ` `class` `GFG ` `{ ` ` ` `// Function to find ` `// Hendecagonal number ` `static` `int` `hendecagonal_num(` `int` `n) ` `{ ` ` ` `// Formula to calculate nth ` ` ` `// Hendecagonal number ` ` ` `return` `(` `9` `* n * n - ` ` ` `7` `* n) / ` `2` `; ` `} ` ` ` `// Driver Code ` `public` `static` `void` `main (String[] args) ` `{ ` `int` `n = ` `3` `; ` `System.out.print(n + ` `"rd Hendecagonal "` `+ ` ` ` `"number: "` `); ` `System.out.println(hendecagonal_num(n)); ` ` ` `n = ` `10` `; ` `System.out.print(n + ` `"th Hendecagonal "` `+ ` ` ` `"number: "` `); ` `System.out.println(hendecagonal_num(n)); ` `} ` `} ` ` ` `// This code is contributed by ajit ` |

*chevron_right*

*filter_none*

## Python3

`# Program to find nth ` `# Hendecagonal number ` ` ` `# Function of Hendecagonal ` `# number ` `def` `hendecagonal_num(n) : ` ` ` ` ` `# Formula to calculate nth ` ` ` `# Hendecagonal number & ` ` ` `# return it into main function. ` ` ` ` ` `return` `(` `9` `*` `n ` `*` `n ` `-` ` ` `7` `*` `n) ` `/` `/` `2` ` ` `# Driver Code ` `if` `__name__ ` `=` `=` `'__main__'` `: ` ` ` ` ` `n ` `=` `3` ` ` `print` `(n,` `"rd Hendecagonal number : "` `, ` ` ` `hendecagonal_num(n)) ` ` ` ` ` `n ` `=` `10` ` ` `print` `(n,` `"th Hendecagonal number : "` `, ` ` ` `hendecagonal_num(n)) ` ` ` `# This code is contributed by ajit ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find nth ` `// Hendecagonal number ` `using` `System; ` ` ` `class` `GFG ` `{ ` `// Function to find ` `// Hendecagonal number ` `static` `int` `hendecagonal_num(` `int` `n) ` `{ ` ` ` `// Formula to calculate nth ` ` ` `// Hendecagonal number ` ` ` `return` `(9 * n * n - 7 * n) / 2; ` `} ` ` ` `// Driver Code ` `static` `public` `void` `Main () ` `{ ` ` ` `int` `n = 3; ` ` ` `Console.Write(n + ` ` ` `"rd Hendecagonal number: "` `); ` ` ` `Console.WriteLine( hendecagonal_num(n)); ` ` ` ` ` `n = 10; ` ` ` `Console.Write(n + ` ` ` `"th Hendecagonal number: "` `); ` ` ` `Console.WriteLine( hendecagonal_num(n)); ` ` ` `} ` `} ` ` ` `// This code is contributed by aj_36 ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to find nth ` `// Hendecagonal number ` ` ` `// Function to find ` `// Hendecagonal number ` ` ` `function` `hendecagonal_num(` `$n` `) ` `{ ` ` ` ` ` `// Formula to calculate nth ` ` ` `// Hendecagonal number ` ` ` `return` `(9 * ` `$n` `* ` `$n` `- 7 * ` `$n` `) / 2; ` `} ` ` ` `// Driver Code ` `$n` `= 3; ` `echo` `$n` `, ` `"th Hendecagonal number: "` `; ` `echo` `hendecagonal_num(` `$n` `); ` `echo` `"\n"` `; ` ` ` `$n` `= 10; ` `echo` `$n` `, ` `"th Hendecagonal number: "` `; ` `echo` `hendecagonal_num(` `$n` `); ` ` ` `// This code is contributed by m_kit ` `?> ` |

*chevron_right*

*filter_none*

**Output :**

3th Hendecagonal number: 30 10th Hendecagonal number: 415

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:

- Program to check if N is a Hendecagonal Number
- Number of factors of very large number N modulo M where M is any prime number
- Find the largest number smaller than integer N with maximum number of set bits
- Minimum number of distinct powers of 2 required to express a given binary number
- 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
- Count number of trailing zeros in Binary representation of a number using Bitset
- Number of possible permutations when absolute difference between number of elements to the right and left are given
- Find the number of positive integers less than or equal to N that have an odd number of digits
- Find the minimum number to be added to N to make it a prime number
- Largest number dividing maximum number of elements in the array
- Smallest number dividing minimum number of elements in the Array
- Minimum divisor of a number to make the number perfect cube
- Smallest number dividing minimum number of elements in the array | Set 2
- Find smallest number formed by inverting digits of given number N
- Minimum number of swaps required to make a number divisible by 60
- Given number of matches played, find number of teams in tournament
- Find smallest possible Number from a given large Number with same count of digits
- Number of distinct ways to represent a number as sum of K unique primes
- Number of times the largest perfect square number can be subtracted from 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.