Base | Representation |
---|---|
bin | 1001001000001100110000… |
… | …00001000010100100010100 |
3 | 2122001221202011222122002110 |
4 | 10210012120001002210110 |
5 | 10112333331220134300 |
6 | 110405213344311020 |
7 | 4141135660531143 |
oct | 444063001024424 |
9 | 78057664878073 |
10 | 20072932583700 |
11 | 64399791636a7 |
12 | 2302328612470 |
13 | b27b3c16a0c9 |
14 | 4d576c52b75a |
15 | 24c222b70550 |
hex | 124198042914 |
20072932583700 has 72 divisors (see below), whose sum is σ = 58425455656512. Its totient is φ = 5320729422080.
The previous prime is 20072932583663. The next prime is 20072932583747. The reversal of 20072932583700 is 738523927002.
It is a self number, because there is not a number n which added to its sum of digits gives 20072932583700.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 200278569 + ... + 200378768.
It is an arithmetic number, because the mean of its divisors is an integer number (811464661896).
Almost surely, 220072932583700 is an apocalyptic number.
20072932583700 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20072932583700 is an abundant number, since it is smaller than the sum of its proper divisors (38352523072812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20072932583700 is a wasteful number, since it uses less digits than its factorization.
20072932583700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400657521 (or 400657514 counting only the distinct ones).
The product of its (nonzero) digits is 1270080, while the sum is 48.
The spelling of 20072932583700 in words is "twenty trillion, seventy-two billion, nine hundred thirty-two million, five hundred eighty-three thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •