Base | Representation |
---|---|
bin | 11101000110101111010… |
… | …111101011000010001101 |
3 | 21002012121112210112210001 |
4 | 131012233113223002031 |
5 | 230232202103323041 |
6 | 4130500103244301 |
7 | 264334251404212 |
oct | 35065727530215 |
9 | 7065545715701 |
10 | 2000102011021 |
11 | 701269496214 |
12 | 283772149691 |
13 | 1167bb73031a |
14 | 6cb3c245b09 |
15 | 37061e2d131 |
hex | 1d1af5eb08d |
2000102011021 has 2 divisors, whose sum is σ = 2000102011022. Its totient is φ = 2000102011020.
The previous prime is 2000102011003. The next prime is 2000102011087. The reversal of 2000102011021 is 1201102010002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1278570686121 + 721531324900 = 1130739^2 + 849430^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000102011021 - 29 = 2000102010509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2000102010989 and 2000102011007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000102012021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000051005510 + 1000051005511.
It is an arithmetic number, because the mean of its divisors is an integer number (1000051005511).
Almost surely, 22000102011021 is an apocalyptic number.
It is an amenable number.
2000102011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000102011021 is an equidigital number, since it uses as much as digits as its factorization.
2000102011021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2000102011021 its reverse (1201102010002), we get a palindrome (3201204021023).
The spelling of 2000102011021 in words is "two trillion, one hundred two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •