Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …10111011000010111000100 |
3 | 2122112010020210212110122210 |
4 | 10211330321313120113010 |
5 | 10121430003203341400 |
6 | 110543502242023420 |
7 | 4153262560033305 |
oct | 445747167302704 |
9 | 78463223773583 |
10 | 20200202012100 |
11 | 6488948465990 |
12 | 2322b26947b70 |
13 | b36b42412ca6 |
14 | 4db9a30c67ac |
15 | 2506c0e10950 |
hex | 125f39dd85c4 |
20200202012100 has 144 divisors (see below), whose sum is σ = 66531321722880. Its totient is φ = 4684104796800.
The previous prime is 20200202012087. The next prime is 20200202012129. The reversal of 20200202012100 is 121020200202.
It is a super-2 number, since 2×202002020121002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 132995260 + ... + 133147059.
It is an arithmetic number, because the mean of its divisors is an integer number (462023067520).
Almost surely, 220200202012100 is an apocalyptic number.
20200202012100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20200202012100 is an abundant number, since it is smaller than the sum of its proper divisors (46331119710780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20200202012100 is a wasteful number, since it uses less digits than its factorization.
20200202012100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266142370 (or 266142363 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20200202012100 its reverse (121020200202), we get a palindrome (20321222212302).
The spelling of 20200202012100 in words is "twenty trillion, two hundred billion, two hundred two million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •