Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …110110010101111000001 |
3 | 21010011110010101121101101 |
4 | 131100003332302233001 |
5 | 230413202020040123 |
6 | 4135233225134401 |
7 | 265140302503525 |
oct | 35200376625701 |
9 | 7104403347341 |
10 | 2010111486913 |
11 | 705535592642 |
12 | 2856a632a401 |
13 | 11772538791a |
14 | 6d40b753d85 |
15 | 3744aa5daad |
hex | 1d403fb2bc1 |
2010111486913 has 2 divisors, whose sum is σ = 2010111486914. Its totient is φ = 2010111486912.
The previous prime is 2010111486863. The next prime is 2010111486919. The reversal of 2010111486913 is 3196841110102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1978433538624 + 31677948289 = 1406568^2 + 177983^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2010111486913 is a prime.
It is not a weakly prime, because it can be changed into another prime (2010111486919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005055743456 + 1005055743457.
It is an arithmetic number, because the mean of its divisors is an integer number (1005055743457).
Almost surely, 22010111486913 is an apocalyptic number.
It is an amenable number.
2010111486913 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010111486913 is an equidigital number, since it uses as much as digits as its factorization.
2010111486913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 37.
The spelling of 2010111486913 in words is "two trillion, ten billion, one hundred eleven million, four hundred eighty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •