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 :16
Input :7
Output :301
Formula to calculate hexadecagonal number:
C++
#include <bits/stdc++.h>
using namespace std;
int hexadecagonalNum( long int n)
{
return ((14 * n * n) - 12 * n) / 2;
}
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;
}
|
C
#include <stdio.h>
int hexadecagonalNum( long int n)
{
return ((14 * n * n) - 12 * n) / 2;
}
int main()
{
long int n = 5;
printf ( "%ldth Hexadecagonal number : " ,n);
printf ( "%d\n" ,hexadecagonalNum(n));
n = 9;
printf ( "%ldth Hexadecagonal number : " ,n);
printf ( "%d\n" ,hexadecagonalNum(n));
return 0;
}
|
Java
import java.io.*;
class GFG {
static long hexadecagonalNum( long n)
{
return (( 14 * n * n) - 12 * n) / 2 ;
}
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));
}
}
|
Python3
def hexadecagonalNum(n):
return (( 14 * n * n) - 12 * n) / / 2
n = 5
print ( "%sth Hexadecagonal number : " % n,
hexadecagonalNum(n))
n = 9
print ( "%sth Hexadecagonal number : " % n,
hexadecagonalNum(n))
|
C#
using System;
class GFG {
static long hexadecagonalNum( long n)
{
return ((14 * n * n) - 12 * n) / 2;
}
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));
}
}
|
PHP
<?php
function hexadecagonalNum( $n )
{
return ((14 * $n * $n ) - 12 * $n ) / 2;
}
$n = 5;
echo $n , "th Hexadecagonal number : " ;
echo hexadecagonalNum( $n );
echo "\n" ;
$n = 9;
echo $n , "th Hexadecagonal number : " ;
echo hexadecagonalNum( $n );
?>
|
Javascript
<script>
function hexadecagonalNum(n)
{
return ((14 * n * n) - 12 * n) / 2;
}
var n = 5;
document.write(n + "th " +
"Hexadecagonal number : " +
hexadecagonalNum(n) + "<br>" );
n = 9;
document.write(n + "th " +
"Hexadecagonal number : " +
hexadecagonalNum(n));
</script>
|
5th Hexadecagonal number : 145
9th Hexadecagonal number : 513
Time Complexity: O(1)
Auxiliary Space: O(1)
Reference: https://en.wikipedia.org/wiki/Polygonal_number