Base | Representation |
---|---|
bin | 11101000111110010101… |
… | …011100110110011000011 |
3 | 21002022112020202212202212 |
4 | 131013302223212303003 |
5 | 230242010203410034 |
6 | 4131204124132335 |
7 | 264404243316134 |
oct | 35076253466303 |
9 | 7068466685685 |
10 | 2001231310019 |
11 | 7017989a2277 |
12 | 283a283970ab |
13 | 11693b69bb96 |
14 | 6cc0820dc8b |
15 | 370cb1502ce |
hex | 1d1f2ae6cc3 |
2001231310019 has 2 divisors, whose sum is σ = 2001231310020. Its totient is φ = 2001231310018.
The previous prime is 2001231310007. The next prime is 2001231310031. The reversal of 2001231310019 is 9100131321002.
It is a balanced prime because it is at equal distance from previous prime (2001231310007) and next prime (2001231310031).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001231310019 is a prime.
It is a super-2 number, since 2×20012313100192 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2001231309976 and 2001231310003.
It is not a weakly prime, because it can be changed into another prime (2001231310069) 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, 1000615655009 + 1000615655010.
It is an arithmetic number, because the mean of its divisors is an integer number (1000615655010).
Almost surely, 22001231310019 is an apocalyptic number.
2001231310019 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001231310019 is an equidigital number, since it uses as much as digits as its factorization.
2001231310019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 2001231310019 in words is "two trillion, one billion, two hundred thirty-one million, three hundred ten thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •