Base | Representation |
---|---|
bin | 1001001001100110101010… |
… | …00110010100111101101000 |
3 | 2122020120100011110001212212 |
4 | 10210303111012110331220 |
5 | 10114131210204121300 |
6 | 110443315210024252 |
7 | 4144465100135231 |
oct | 444632506247550 |
9 | 78216304401785 |
10 | 20121202020200 |
11 | 6458398a88786 |
12 | 230b759a18088 |
13 | b2c56251bc58 |
14 | 4d7c2b09c088 |
15 | 24d5ea625935 |
hex | 124cd5194f68 |
20121202020200 has 24 divisors (see below), whose sum is σ = 46781794697430. Its totient is φ = 8048480808000.
The previous prime is 20121202020197. The next prime is 20121202020233. The reversal of 20121202020200 is 202020212102.
It can be written as a sum of positive squares in 3 ways, for example, as 15605075506276 + 4516126513924 = 3950326^2 + 2125118^2 .
It is a super-2 number, since 2×201212020202002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 50303004851 + ... + 50303005250.
Almost surely, 220121202020200 is an apocalyptic number.
20121202020200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20121202020200 is an abundant number, since it is smaller than the sum of its proper divisors (26660592677230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20121202020200 is a wasteful number, since it uses less digits than its factorization.
20121202020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100606010117 (or 100606010108 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 20121202020200 its reverse (202020212102), we get a palindrome (20323222232302).
The spelling of 20121202020200 in words is "twenty trillion, one hundred twenty-one billion, two hundred two million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •