Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …10101000011101001000100 |
3 | 2121211000000100012021112102 |
4 | 10203002220311003221010 |
5 | 10110140402223223022 |
6 | 110311544245211232 |
7 | 4132652414545310 |
oct | 443025065035104 |
9 | 77730010167472 |
10 | 20000200211012 |
11 | 641104568458a |
12 | 22b020a700b18 |
13 | b2101a9130a8 |
14 | 4d202ca96b40 |
15 | 24a3b7732a92 |
hex | 1230a8d43a44 |
20000200211012 has 12 divisors (see below), whose sum is σ = 40000400422080. Its totient is φ = 8571514376136.
The previous prime is 20000200210987. The next prime is 20000200211053. The reversal of 20000200211012 is 21011200200002.
It is a happy number.
20000200211012 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 20000200210984 and 20000200211002.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 357146432312 + ... + 357146432367.
It is an arithmetic number, because the mean of its divisors is an integer number (3333366701840).
Almost surely, 220000200211012 is an apocalyptic number.
It is an amenable number.
20000200211012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000200211012 is a wasteful number, since it uses less digits than its factorization.
20000200211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714292864690 (or 714292864688 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20000200211012 its reverse (21011200200002), we get a palindrome (41011400411014).
The spelling of 20000200211012 in words is "twenty trillion, two hundred million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •