Base | Representation |
---|---|
bin | 11101000110101111011… |
… | …000011001001100100101 |
3 | 21002012121120011011011000 |
4 | 131012233120121030211 |
5 | 230232202130400401 |
6 | 4130500111303513 |
7 | 264334253122365 |
oct | 35065730311445 |
9 | 7065546134130 |
10 | 2000102200101 |
11 | 701269605285 |
12 | 28377221ab99 |
13 | 1167bb7983c5 |
14 | 6cb3c2949a5 |
15 | 37061e69186 |
hex | 1d1af619325 |
2000102200101 has 8 divisors (see below), whose sum is σ = 2963114370560. Its totient is φ = 1333401466716.
The previous prime is 2000102200091. The next prime is 2000102200111. The reversal of 2000102200101 is 1010022010002.
It is an interprime number because it is at equal distance from previous prime (2000102200091) and next prime (2000102200111).
It is not a de Polignac number, because 2000102200101 - 218 = 2000101937957 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 (2000102200111) 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, 37038929605 + ... + 37038929658.
It is an arithmetic number, because the mean of its divisors is an integer number (370389296320).
Almost surely, 22000102200101 is an apocalyptic number.
It is an amenable number.
2000102200101 is a deficient number, since it is larger than the sum of its proper divisors (963012170459).
2000102200101 is an equidigital number, since it uses as much as digits as its factorization.
2000102200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74077859272 (or 74077859266 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2000102200101 its reverse (1010022010002), we get a palindrome (3010124210103).
The spelling of 2000102200101 in words is "two trillion, one hundred two million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •