Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …001000100010101010101 |
3 | 21002012101010212002102222 |
4 | 131012221321010111111 |
5 | 230232010041231401 |
6 | 4130443021312125 |
7 | 264332054241164 |
oct | 35065171042525 |
9 | 7065333762388 |
10 | 2000010102101 |
11 | 701221620730 |
12 | 283747405645 |
13 | 1167a569054b |
14 | 6cb2dd5d3db |
15 | 37058d25c1b |
hex | 1d1a9e44555 |
2000010102101 has 8 divisors (see below), whose sum is σ = 2181907624608. Its totient is φ = 1818125650000.
The previous prime is 2000010102073. The next prime is 2000010102131. The reversal of 2000010102101 is 1012010100002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2000010102101 - 218 = 2000009839957 is a prime.
It is a super-2 number, since 2×20000101021012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000010102131) 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, 2946275 + ... + 3560976.
It is an arithmetic number, because the mean of its divisors is an integer number (272738453076).
Almost surely, 22000010102101 is an apocalyptic number.
It is an amenable number.
2000010102101 is a deficient number, since it is larger than the sum of its proper divisors (181897522507).
2000010102101 is a wasteful number, since it uses less digits than its factorization.
2000010102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6535203.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 2000010102101 its reverse (1012010100002), we get a palindrome (3012020202103).
It can be divided in two parts, 20000 and 10102101, that added together give a palindrome (10122101).
The spelling of 2000010102101 in words is "two trillion, ten million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •