Skip to content
Related Articles

Related Articles

Improve Article

Trimorphic Number

  • Last Updated : 13 Jul, 2021
Geek Week

Given a number N, the task is to check whether the number is Trimorphic number or not. A number is called Trimorphic number if and only if its cube ends in the same digits as the number itself. In other words, number appears at the end of its cube.

Examples: 

Input : 5 
Output : trimorphic 
Explanation: 5*5*5=125

Input : 24 
Output : trimorphic 
Explanation: 24*24*24=13824 

Input:10 
Output: not trimorphic 
Explanation: 10*10*10=1000

Approach:  

1. Store the cube of given number.
2. Loop until N becomes 0 as we have to match 
   all digits with its cube.
    i) Check if (n%10 == cube%10) i.e. last digit 
       of number = last digit of cube or not
        a) if not equal, return false.
    ii) Otherwise continue i.e. reduce number and 
        cube i.e. n = n/10 and cube = cube/10;
3- Return true if all digits matched.

Below is the implementation of the approach.  

C++




// C++ program to check if a
// number is Trimorphic
#include <iostream>
using namespace std;
 
// Function to check Trimorphic number
bool isTrimorphic(int N)
{
    // Store the cube
    int cube = N * N * N;
 
    // Start Comparing digits
    while (N > 0)
    {
        // Return false, if any digit
        // of N doesn't match with
        // its cube's digits from last
        if (N % 10 != cube % 10)
            return false;
 
        // Reduce N and cube
        N /= 10;
        cube /= 10;
    }
 
    return true;
}
 
// Driver code
int main()
{
    int N = 24;
 
    isTrimorphic(N) ? cout << "trimorphic" :
                      cout << "not trimporphic";
 
    return 0;
}
Java



// Java program to check if a
// number is Trimorphic
  
class GFG {
  
  // Function to check Trimorphic number
    static boolean isTrimorphic(int N)
    {
        // Store the cube
        int cube = N * N * N;
  
        // Start Comparing digits
        while (N > 0) {
  
         // Return false, if any digit
         // of N doesn't match with
         // its cube's digits from last
         if (N % 10 != cube % 10)
            return false;
  
            // Reduce N and cube
            N /= 10;
            cube /= 10;
        }
  
        return true;
    }
  
// Driver code
public static void main(String[] args)
    {
        int N = 24;
  
        if (isTrimorphic(N) == true)
        System.out.println("trimorphic");
        else
        System.out.println("not trimorphic");
    }
}
  
//This article is contributed by prerna saini.
Python3



# Python 3 program to check
# if a number is Trimorphic
 
  
# Function to check
# Trimorphic number
def isTrimorphic(N) :
     
    # Store the cube
    cube = N * N * N
  
    # Start Comparing digits
    while (N > 0) :
        
        # Return false, if any digit
        # of N doesn't match with
        # its cube's digits from last
        if (N % 10 != cube % 10) :
            return False
  
        # Reduce N and cube
        N = N // 10
        cube = cube // 10
     
    return True
 
 
# Driver code
N = 24
if(isTrimorphic(N)) :
    print("trimorphic")
else :
    print("not trimporphic")
     
     
# This code is contributed by Nikita tiwari.
C#



// C# program to check if
// a number is Trimorphic
using System;
 
class GFG {
 
// Function to check Trimorphic number
    static bool isTrimorphic(int N)
    {
        // Store the cube
        int cube = N * N * N;
 
        // Start Comparing digits
        while (N > 0) {
 
        // Return false, if any digit
        // of N doesn't match with
        // its cube's digits from last
        if (N % 10 != cube % 10)
            return false;
 
            // Reduce N and cube
            N /= 10;
            cube /= 10;
        }
 
        return true;
    }
 
// Driver code
public static void Main()
    {
        int N = 24;
 
        if (isTrimorphic(N) == true)
        Console.Write("trimorphic");
        else
        Console.Write("not trimorphic");
    }
}
 
// This article is contributed
// by Smitha Dinesh Semwal.
PHP



<?php
//PHP program to check if a
// number is Trimorphic
 
// Function to check Trimorphic
// number
function isTrimorphic($N)
{
     
    // Store the cube
    $cube = $N * $N * $N;
 
    // Start Comparing digits
    while ($N > 0)
    {
         
        // Return false, if any digit
        // of N doesn't match with
        // its cube's digits from last
        if ($N % 10 != $cube % 10)
            return -1;
 
        // Reduce N and cube
        $N /= 10;
        $cube /= 10;
    }
 
    return 1;
}
 
// Driver code
    $N = 24;
 
    $r = isTrimorphic($N) ? "trimorphic" :
                      "not trimporphic";
    echo $r;
 
// This code is contributed by aj_36
?>
Javascript



<script>
 
// Javascript program to check if
// a number is Trimorphic
 
// Function to check Trimorphic number
function isTrimorphic(N)
{
     
    // Store the cube
    let cube = N * N * N;
 
    // Start Comparing digits
    while (N > 0)
    {
         
        // Return false, if any digit
        // of N doesn't match with
        // its cube's digits from last
        if (N % 10 != cube % 10)
            return false;
     
        // Reduce N and cube
        N = parseInt(N / 10, 10);
        cube = parseInt(cube / 10, 10);
    }
    return true;
}
 
// Driver code
let N = 24;
 
if (isTrimorphic(N) == true)
    document.write("trimorphic");
else
    document.write("not trimorphic");
     
// This code is contributed by rameshtravel07
 
</script>
Output: 


trimorphic
Find nth Trimorphic Number 
Examples: 
Input  : 10 
Output : 51

Input  : 11
Output : 75
C++



// CPP program to find nth
// Trimorphic number
#include <iostream>
using namespace std;
 
# define INT_MAX 2147483647
// Functions to find nth
// Trimorphic number
bool checkTrimorphic(int num)
{
    int cube = num * num * num;
    // Comparing the digits
    while(num > 0)
    {
        // Return false, if any digit
        // of num doesn't match with
        // its cube's digits from last
        if (num % 10 != cube % 10)
            return false;
 
        // Reduce num and cube
        num /= 10;
        cube /= 10;
    }
    return true;
}
int nthTrimorphic(int n)
{
     
    int count = 0;
    // Check in max int size
    for(int i = 0; i < INT_MAX; i++)
    {
        //check number is Trimorphic or not
        if(checkTrimorphic(i))
            count++;
             
        // if counter is equal to the
        // n then return nth number
        if(count == n)
            return i;
    }
}
 
// Driver code
int main()
{
    int n = 9;
    cout<< nthTrimorphic(n);
    return 0;
}
 
// This code is contributed by jaingyayak.
Java



// Java program to find nth
// Trimorphic number
 
 
class GFG
{
static int INT_MAX = 2147483647;
 
// Functions to find nth
// Trimorphic number
static boolean checkTrimorphic(int num)
{
    int cube = num * num * num;
     
    // Comparing the digits
    while(num > 0)
    {
        // Return false, if any
        // digit of num doesn't
        // match with its cube's
        // digits from last
        if (num % 10 != cube % 10)
            return false;
 
        // Reduce num and cube
        num /= 10;
        cube /= 10;
    }
    return true;
}
 
static int nthTrimorphic(int n)
{
     
    int count = 0;
     
    // Check in max int size
    for(int i = 0; i < INT_MAX; i++)
    {
        // check number is
        // Trimorphic or not
        if(checkTrimorphic(i))
            count++;
             
        // if counter is equal to
        // the n then return nth number
        if(count == n)
            return i;
    }
    return -1;
}
 
// Driver code
public static void main(String[] args)
{
    int n = 9;
    System.out.println(nthTrimorphic(n));
}
}
 
// This code is contributed by mits.
Python3



# Python3 program to find
# nth Trimorphic number
import sys
# Functions to find nth
# Trimorphic number
def checkTrimorphic(num):
 
    cube = num * num * num
     
    # Comparing the digits
    while(num > 0):
        # Return false, if any digit
        # of num doesn't match with
        # its cube's digits from last
        if (num % 10 != cube % 10):
            return False
 
        # Reduce num and cube
        num = int(num / 10)
        cube = int(cube / 10)
    return True
 
 
def nthTrimorphic(n):
    count = 0
     
    # Check in max int size
    for i in range(sys.maxsize):
        # check number is
        # Trimorphic or not
        if(checkTrimorphic(i)):
            count+=1
             
        # if counter is equal to
        # the n then return nth
        # number
        if(count == n):
            return i
 
 
 
# Driver code
if __name__=='__main__':
    n = 9
    print(nthTrimorphic(n))
 
# This code is contributed
# by mits.
C#



// C# program to find nth
// Trimorphic number
using System;
 
class GFG
{
static int INT_MAX = 2147483647;
 
// Functions to find nth
// Trimorphic number
static bool checkTrimorphic(int num)
{
    int cube = num * num * num;
     
    // Comparing the digits
    while(num > 0)
    {
        // Return false, if any
        // digit of num doesn't
        // match with its cube's
        // digits from last
        if (num % 10 != cube % 10)
            return false;
 
        // Reduce num and cube
        num /= 10;
        cube /= 10;
    }
    return true;
}
 
static int nthTrimorphic(int n)
{
     
    int count = 0;
     
    // Check in max int size
    for(int i = 0; i < INT_MAX; i++)
    {
        // check number is
        // Trimorphic or not
        if(checkTrimorphic(i))
            count++;
             
        // if counter is equal to
        // the n then return nth number
        if(count == n)
            return i;
    }
    return -1;
}
 
// Driver code
static int Main()
{
    int n = 9;
    Console.Write(nthTrimorphic(n));
    return 0;
}
}
 
// This code is contributed by mits.
PHP



<?php
// PHP program to find
// nth Trimorphic number
 
// Functions to find nth
// Trimorphic number
function checkTrimorphic($num)
{
    $cube = $num * $num * $num;
     
    // Comparing the digits
    while($num > 0)
    {
        // Return false, if any digit
        // of num doesn't match with
        // its cube's digits from last
        if ($num % 10 != $cube % 10)
            return false;
 
        // Reduce num and cube
        $num = (int)($num / 10);
        $cube = (int)($cube / 10);
    }
    return true;
}
 
function nthTrimorphic($n)
{
    $count = 0;
     
    // Check in max int size
    for($i = 0;
        $i < PHP_INT_MAX; $i++)
    {
        // check number is
        // Trimorphic or not
        if(checkTrimorphic($i))
            $count++;
             
        // if counter is equal to
        // the n then return nth
        // number
        if($count == $n)
            return $i;
    }
}
 
// Driver code
$n = 9;
echo nthTrimorphic($n);
 
// This code is contributed
// by mits.
?>
Javascript



<script>
   
// JavaScript program for the above approach
 
let LET_MAX = 2147483647;
 
// Functions to find nth
// Trimorphic number
function checkTrimorphic(num)
{
    let cube = num * num * num;
     
    // Comparing the digits
    while(num > 0)
    {
        // Return false, if any
        // digit of num doesn't
        // match with its cube's
        // digits from last
        if (num % 10 != cube % 10)
            return false;
 
        // Reduce num and cube
        num = Math.floor(num / 10);
        cube = Math.floor(cube / 10);
    }
    return true;
}
 
function nthTrimorphic(n)
{
     
    let count = 0;
     
    // Check in max let size
    for(let i = 0; i < LET_MAX; i++)
    {
        // check number is
        // Trimorphic or not
        if(checkTrimorphic(i))
            count++;
             
        // if counter is equal to
        // the n then return nth number
        if(count == n)
            return i;
    }
    return -1;
}
 
// Driver Code
 
    let n = 9;
    document.write(nthTrimorphic(n));
         
</script>
Output: 
49
 
Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.



My Personal Notes
arrow_drop_up
Previous
Number of triangles formed by joining vertices of n-sided polygon with one side common
Next

Sum of fifth powers of the first n natural numbers
Recommended Articles
Page :
Permutation of a number whose sum with the original number is equal to another given number
18, Feb 21
Minimum number of moves to make M and N equal by repeatedly adding any divisor of number to itself except 1 and the number
12, Jul 21
Number of factors of very large number N modulo M where M is any prime number
31, Mar 20
Find minimum number to be divided to make a number a perfect square
19, Jan 17
How to check if a given number is Fibonacci number?
14, Oct 13
Find the smallest number whose digits multiply to a given number n
09, Jun 14
Find n'th number in a number system with only 3 and 4
03, Oct 14
Querying maximum number of divisors that a number in a given range has
04, Nov 16
Check if a number is a power of another number
20, Apr 16
Finding number of digits in n'th Fibonacci number
28, Sep 16
Number with maximum number of prime factors
07, Mar 17
Convert a number m to n using minimum number of given operations
08, May 17
Determine whether a given number is a Hyperperfect Number
17, May 17
Convert a binary number to hexadecimal number
28, May 17
Number of times the largest perfect square number can be subtracted from N
08, Apr 19
Find if a number is divisible by every number in a list
23, Jun 17
Check if a number is a Krishnamurthy Number or not
26, Jun 17
Round-off a number to a given number of significant digits
04, Jul 17
Program to calculate the number of odd days in given number of years
10, Apr 19
Number of times a number can be replaced by the sum of its digits until it only contains one digit
16, Jul 17
Total number of divisors for a given number
10, Sep 17
Check Whether a number is Duck Number or not
11, Sep 17
Number of compositions of a natural number
08, Oct 17
Check if a number is divisible by all prime divisors of another number
18, Oct 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Rahul_
@Rahul_
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox