Given an integer N, the task is to check if it is a Tridecagonal number or not.
Tridecagon number is a thirteen-sided polygon. The first few Tridecagon numbers are 1, 13, 36, 70, 115, 171, …
Input: N = 13
Second Tridecagon number is 13.
Input: N = 30
- The Kth term of the Tridecagon number is given as
- As we have to check that the given number can be expressed as a Tridecagon number or not. This can be checked as follows –
- Finally, check the value of computed using this formulae is an integer, which means that N is a Tridecagon number.
Below is the implementation of the above approach:
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.
- Program to check if N is a Centered Tridecagonal Number
- Centered tridecagonal number
- Tridecagonal Number
- Find the sum of the first Nth Centered Tridecagonal Numbers
- Program to check whether a number is Proth number or not
- Recursive program to check if number is palindrome or not
- Program to check if N is a Hexagonal Number or not
- Program to check if N is a Centered Pentagonal Number or not
- C Program to check whether a number is a Perfect Cube or not
- Check if a number is a Krishnamurthy Number or not
- Check Whether a number is Duck Number or not
- Check if given number is Emirp Number or not
- Check if a number with even number of digits is palindrome or not
- Check whether the given number is Euclid Number or not
- Check if the given number is Ore number or not
- Check if a number is an Unusual Number or not
- Check if a number is an Achilles number or not
- Check whether all the rotations of a given number is greater than or equal to the given number or not
- Check whether given number N is a Moran Number or not
- Check whether a given number N is a Nude 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 firstname.lastname@example.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.