Base | Representation |
---|---|
bin | 11101000110101010100… |
… | …011011001110011100101 |
3 | 21002012101220201221001000 |
4 | 131012222203121303211 |
5 | 230232020411400401 |
6 | 4130444055223513 |
7 | 264332250462651 |
oct | 35065243316345 |
9 | 7065356657030 |
10 | 2000021200101 |
11 | 701227910831 |
12 | 28374b077b99 |
13 | 1167a7a77b02 |
14 | 6cb3160ba61 |
15 | 37059cb9186 |
hex | 1d1aa8d9ce5 |
2000021200101 has 8 divisors (see below), whose sum is σ = 2962994370560. Its totient is φ = 1333347466716.
The previous prime is 2000021200087. The next prime is 2000021200139. The reversal of 2000021200101 is 1010021200002.
It is not a de Polignac number, because 2000021200101 - 27 = 2000021199973 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000021200171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37037429605 + ... + 37037429658.
It is an arithmetic number, because the mean of its divisors is an integer number (370374296320).
Almost surely, 22000021200101 is an apocalyptic number.
It is an amenable number.
2000021200101 is a deficient number, since it is larger than the sum of its proper divisors (962973170459).
2000021200101 is an equidigital number, since it uses as much as digits as its factorization.
2000021200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74074859272 (or 74074859266 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2000021200101 its reverse (1010021200002), we get a palindrome (3010042400103).
Subtracting from 2000021200101 its reverse (1010021200002), we obtain a palindrome (990000000099).
The spelling of 2000021200101 in words is "two trillion, twenty-one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •