Base | Representation |
---|---|
bin | 1001000110001101000001… |
… | …00100101010000100101011 |
3 | 2121211101202000021211202211 |
4 | 10203012200210222010223 |
5 | 10110222410301132142 |
6 | 110313512524305551 |
7 | 4133160415026016 |
oct | 443064044520453 |
9 | 77741660254684 |
10 | 20004356661547 |
11 | 6412888906375 |
12 | 22b0b8a6a22b7 |
13 | b21530a8178b |
14 | 4d2304ad437d |
15 | 24a55c5ad917 |
hex | 1231a092a12b |
20004356661547 has 8 divisors (see below), whose sum is σ = 20054315521712. Its totient is φ = 19954409378400.
The previous prime is 20004356661517. The next prime is 20004356661551. The reversal of 20004356661547 is 74516665340002.
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 20004356661547 - 211 = 20004356659499 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20004356661547.
It is not an unprimeable number, because it can be changed into a prime (20004356661517) by changing a digit.
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, 571108 + ... + 6350974.
It is an arithmetic number, because the mean of its divisors is an integer number (2506789440214).
Almost surely, 220004356661547 is an apocalyptic number.
20004356661547 is a deficient number, since it is larger than the sum of its proper divisors (49958860165).
20004356661547 is an equidigital number, since it uses as much as digits as its factorization.
20004356661547 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5788509.
The product of its (nonzero) digits is 3628800, while the sum is 49.
The spelling of 20004356661547 in words is "twenty trillion, four billion, three hundred fifty-six million, six hundred sixty-one thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •