Base | Representation |
---|---|
bin | 1001000110000110110011… |
… | …01101000110110000100100 |
3 | 2121211002010111011112222011 |
4 | 10203003121231012300210 |
5 | 10110144042133211322 |
6 | 110312201500444004 |
7 | 4133011632455446 |
oct | 443033155066044 |
9 | 77732114145864 |
10 | 20001020210212 |
11 | 6411426535078 |
12 | 22b03b9249604 |
13 | b2111b778c12 |
14 | 4d20a994a496 |
15 | 24a41470a677 |
hex | 1230d9b46c24 |
20001020210212 has 6 divisors (see below), whose sum is σ = 35001785367878. Its totient is φ = 10000510105104.
The previous prime is 20001020210203. The next prime is 20001020210221. The reversal of 20001020210212 is 21201202010002.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20001020210203) and next prime (20001020210221).
It can be written as a sum of positive squares in only one way, i.e., 16663507753216 + 3337512456996 = 4082096^2 + 1826886^2 .
It is a junction number, because it is equal to n+sod(n) for n = 20001020210192 and 20001020210201.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 2500127526273 + ... + 2500127526280.
Almost surely, 220001020210212 is an apocalyptic number.
It is an amenable number.
20001020210212 is a deficient number, since it is larger than the sum of its proper divisors (15000765157666).
20001020210212 is a wasteful number, since it uses less digits than its factorization.
20001020210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5000255052557 (or 5000255052555 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20001020210212 its reverse (21201202010002), we get a palindrome (41202222220214).
The spelling of 20001020210212 in words is "twenty trillion, one billion, twenty million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •