Base | Representation |
---|---|
bin | 1001000110001101000000… |
… | …11001000110010101000011 |
3 | 2121211101201210120220101220 |
4 | 10203012200121012111003 |
5 | 10110222404012202210 |
6 | 110313512335330123 |
7 | 4133160350206146 |
oct | 443064031062503 |
9 | 77741653526356 |
10 | 20004353631555 |
11 | 6412887126947 |
12 | 22b0b89680943 |
13 | b21530260597 |
14 | 4d230454605d |
15 | 24a55c1b0c70 |
hex | 1231a0646543 |
20004353631555 has 8 divisors (see below), whose sum is σ = 32006965810512. Its totient is φ = 10668988603488.
The previous prime is 20004353631499. The next prime is 20004353631611. The reversal of 20004353631555 is 55513635340002.
It is an interprime number because it is at equal distance from previous prime (20004353631499) and next prime (20004353631611).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20004353631555 - 218 = 20004353369411 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 666811787704 + ... + 666811787733.
It is an arithmetic number, because the mean of its divisors is an integer number (4000870726314).
Almost surely, 220004353631555 is an apocalyptic number.
20004353631555 is a deficient number, since it is larger than the sum of its proper divisors (12002612178957).
20004353631555 is a wasteful number, since it uses less digits than its factorization.
20004353631555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1333623575445.
The product of its (nonzero) digits is 810000, while the sum is 42.
Adding to 20004353631555 its reverse (55513635340002), we get a palindrome (75517988971557).
The spelling of 20004353631555 in words is "twenty trillion, four billion, three hundred fifty-three million, six hundred thirty-one thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •