Base | Representation |
---|---|
bin | 110111000001101111010001… |
… | …001010111110110010000101 |
3 | 1011201220010100120212201001111 |
4 | 313001233101022332302011 |
5 | 223210111120033410303 |
6 | 2214414443100325021 |
7 | 101655535515333442 |
oct | 6701572112766205 |
9 | 1151803316781044 |
10 | 242012031544453 |
11 | 701267a9625675 |
12 | 23187677843771 |
13 | a506837948481 |
14 | 43a963285c9c9 |
15 | 1cea44d18ab6d |
hex | dc1bd12bec85 |
242012031544453 has 8 divisors (see below), whose sum is σ = 243153913298688. Its totient is φ = 240872771793264.
The previous prime is 242012031544337. The next prime is 242012031544499. The reversal of 242012031544453 is 354445130210242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 242012031544453 - 29 = 242012031543941 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 (242012031544553) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 655315726 + ... + 655684927.
It is an arithmetic number, because the mean of its divisors is an integer number (30394239162336).
Almost surely, 2242012031544453 is an apocalyptic number.
It is an amenable number.
242012031544453 is a deficient number, since it is larger than the sum of its proper divisors (1141881754235).
242012031544453 is a wasteful number, since it uses less digits than its factorization.
242012031544453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311001523.
The product of its (nonzero) digits is 460800, while the sum is 40.
Adding to 242012031544453 its reverse (354445130210242), we get a palindrome (596457161754695).
The spelling of 242012031544453 in words is "two hundred forty-two trillion, twelve billion, thirty-one million, five hundred forty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •