Base | Representation |
---|---|
bin | 11101000110101111011… |
… | …000011001001110010011 |
3 | 21002012121120011011022002 |
4 | 131012233120121032103 |
5 | 230232202130401321 |
6 | 4130500111304215 |
7 | 264334253122613 |
oct | 35065730311623 |
9 | 7065546134262 |
10 | 2000102200211 |
11 | 701269605375 |
12 | 28377221b06b |
13 | 1167bb79847b |
14 | 6cb3c294a43 |
15 | 37061e6920b |
hex | 1d1af619393 |
2000102200211 has 8 divisors (see below), whose sum is σ = 2000731299840. Its totient is φ = 1999473198408.
The previous prime is 2000102200157. The next prime is 2000102200249. The reversal of 2000102200211 is 1120022010002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000102200211 is a prime.
It is a super-2 number, since 2×20001022002112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000102200192 and 2000102200201.
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, 65849150 + ... + 65879516.
It is an arithmetic number, because the mean of its divisors is an integer number (250091412480).
Almost surely, 22000102200211 is an apocalyptic number.
2000102200211 is a deficient number, since it is larger than the sum of its proper divisors (629099629).
2000102200211 is a wasteful number, since it uses less digits than its factorization.
2000102200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48913.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2000102200211 its reverse (1120022010002), we get a palindrome (3120124210213).
The spelling of 2000102200211 in words is "two trillion, one hundred two million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •