Base | Representation |
---|---|
bin | 1001000110101100010000… |
… | …10110110000010100101010 |
3 | 2121220000000222201120021210 |
4 | 10203112020112300110222 |
5 | 10111011233314430010 |
6 | 110325325200213550 |
7 | 4134323162031045 |
oct | 443261026602452 |
9 | 77800028646253 |
10 | 20021130233130 |
11 | 6419a06080a24 |
12 | 22b429000a2b6 |
13 | b22ca4b96470 |
14 | 4d30566b1c5c |
15 | 24abdee5ab20 |
hex | 1235885b052a |
20021130233130 has 128 divisors (see below), whose sum is σ = 52727463226368. Its totient is φ = 4834908029952.
The previous prime is 20021130233107. The next prime is 20021130233171. The reversal of 20021130233130 is 3133203112002.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20021130233097 and 20021130233106.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 328147087 + ... + 328208093.
It is an arithmetic number, because the mean of its divisors is an integer number (411933306456).
Almost surely, 220021130233130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20021130233130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26363731613184).
20021130233130 is an abundant number, since it is smaller than the sum of its proper divisors (32706332993238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20021130233130 is a wasteful number, since it uses less digits than its factorization.
20021130233130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76960.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20021130233130 its reverse (3133203112002), we get a palindrome (23154333345132).
The spelling of 20021130233130 in words is "twenty trillion, twenty-one billion, one hundred thirty million, two hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •