Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …00001111001111100010000 |
3 | 2121211002121201200122120120 |
4 | 10203003211001321330100 |
5 | 10110144434303241422 |
6 | 110312232405110240 |
7 | 4133016430452033 |
oct | 443034501717420 |
9 | 77732551618516 |
10 | 20001210212112 |
11 | 6411513809338 |
12 | 22b04509b8380 |
13 | b2114bc4248c |
14 | 4d20c6c8901a |
15 | 24a42623c45c |
hex | 1230e5079f10 |
20001210212112 has 80 divisors (see below), whose sum is σ = 53114129734080. Its totient is φ = 6481029044736.
The previous prime is 20001210212083. The next prime is 20001210212117. The reversal of 20001210212112 is 21121201210002.
It is a junction number, because it is equal to n+sod(n) for n = 20001210212091 and 20001210212100.
It is not an unprimeable number, because it can be changed into a prime (20001210212117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3107938 + ... + 7047105.
It is an arithmetic number, because the mean of its divisors is an integer number (663926621676).
Almost surely, 220001210212112 is an apocalyptic number.
It is an amenable number.
20001210212112 is an abundant number, since it is smaller than the sum of its proper divisors (33112919521968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001210212112 is a wasteful number, since it uses less digits than its factorization.
20001210212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10156200 (or 10156194 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20001210212112 its reverse (21121201210002), we get a palindrome (41122411422114).
The spelling of 20001210212112 in words is "twenty trillion, one billion, two hundred ten million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •