Base | Representation |
---|---|
bin | 11000100111000110110001… |
… | …01110101111100010101101 |
3 | 21002121211202110122002022201 |
4 | 30103203120232233202231 |
5 | 24043201204324432423 |
6 | 311034253202141501 |
7 | 14254025414200423 |
oct | 1423433056574255 |
9 | 232554673562281 |
10 | 54120224061613 |
11 | 16276292631666 |
12 | 60a0a41651891 |
13 | 2427690c660b8 |
14 | d5160b937113 |
15 | 63cbd05ce2ad |
hex | 3138d8baf8ad |
54120224061613 has 4 divisors (see below), whose sum is σ = 54161255316960. Its totient is φ = 54079192806268.
The previous prime is 54120224061583. The next prime is 54120224061733. The reversal of 54120224061613 is 31616042202145.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 54120224061613 - 217 = 54120223930541 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54120224161613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20515625695 + ... + 20515628332.
It is an arithmetic number, because the mean of its divisors is an integer number (13540313829240).
Almost surely, 254120224061613 is an apocalyptic number.
It is an amenable number.
54120224061613 is a deficient number, since it is larger than the sum of its proper divisors (41031255347).
54120224061613 is a wasteful number, since it uses less digits than its factorization.
54120224061613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41031255346.
The product of its (nonzero) digits is 69120, while the sum is 37.
Adding to 54120224061613 its reverse (31616042202145), we get a palindrome (85736266263758).
The spelling of 54120224061613 in words is "fifty-four trillion, one hundred twenty billion, two hundred twenty-four million, sixty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •