Base | Representation |
---|---|
bin | 11101010000000100011… |
… | …111010100000011100001 |
3 | 21010011110201102201121101 |
4 | 131100010133110003201 |
5 | 230413211210341001 |
6 | 4135234131554401 |
7 | 265140435121153 |
oct | 35200437240341 |
9 | 7104421381541 |
10 | 2010120012001 |
11 | 70553a385672 |
12 | 2856a915ba01 |
13 | 11772708105a |
14 | 6d40c932ad3 |
15 | 3744b694a01 |
hex | 1d4047d40e1 |
2010120012001 has 2 divisors, whose sum is σ = 2010120012002. Its totient is φ = 2010120012000.
The previous prime is 2010120011993. The next prime is 2010120012077. The reversal of 2010120012001 is 1002100210102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1160402928400 + 849717083601 = 1077220^2 + 921801^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010120012001 - 23 = 2010120011993 is a prime.
It is not a weakly prime, because it can be changed into another prime (2010120072001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005060006000 + 1005060006001.
It is an arithmetic number, because the mean of its divisors is an integer number (1005060006001).
Almost surely, 22010120012001 is an apocalyptic number.
It is an amenable number.
2010120012001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010120012001 is an equidigital number, since it uses as much as digits as its factorization.
2010120012001 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 2010120012001 its reverse (1002100210102), we get a palindrome (3012220222103).
The spelling of 2010120012001 in words is "two trillion, ten billion, one hundred twenty million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •