Base | Representation |
---|---|
bin | 11101000110101111010… |
… | …000011011011011111001 |
3 | 21002012121102020001222102 |
4 | 131012233100123123321 |
5 | 230232201112041441 |
6 | 4130455554433145 |
7 | 264334226305106 |
oct | 35065720333371 |
9 | 7065542201872 |
10 | 2000100112121 |
11 | 701268409581 |
12 | 2837715927b5 |
13 | 1167bb216c07 |
14 | 6cb3bcadaad |
15 | 37061ba569b |
hex | 1d1af41b6f9 |
2000100112121 has 2 divisors, whose sum is σ = 2000100112122. Its totient is φ = 2000100112120.
The previous prime is 2000100112091. The next prime is 2000100112123. The reversal of 2000100112121 is 1212110010002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1929376560400 + 70723551721 = 1389020^2 + 265939^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000100112121 is a prime.
It is a super-2 number, since 2×20001001121212 (a number of 25 digits) contains 22 as substring.
Together with 2000100112123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2000100112123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000050056060 + 1000050056061.
It is an arithmetic number, because the mean of its divisors is an integer number (1000050056061).
Almost surely, 22000100112121 is an apocalyptic number.
It is an amenable number.
2000100112121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000100112121 is an equidigital number, since it uses as much as digits as its factorization.
2000100112121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2000100112121 its reverse (1212110010002), we get a palindrome (3212210122123).
The spelling of 2000100112121 in words is "two trillion, one hundred million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •