Base | Representation |
---|---|
bin | 11101000111101011010… |
… | …010100100001100001111 |
3 | 21002022012121102210011221 |
4 | 131013223102210030033 |
5 | 230241231432231411 |
6 | 4131143534224211 |
7 | 264401206305136 |
oct | 35075322441417 |
9 | 7068177383157 |
10 | 2001107305231 |
11 | 7017349a5681 |
12 | 2839b2955067 |
13 | 11691baa2178 |
14 | 6cbd597091d |
15 | 370c0308071 |
hex | 1d1eb4a430f |
2001107305231 has 2 divisors, whose sum is σ = 2001107305232. Its totient is φ = 2001107305230.
The previous prime is 2001107305193. The next prime is 2001107305273. The reversal of 2001107305231 is 1325037011002.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2001107305231 - 29 = 2001107304719 is a prime.
It is a super-2 number, since 2×20011073052312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2001107305196 and 2001107305205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001107305931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000553652615 + 1000553652616.
It is an arithmetic number, because the mean of its divisors is an integer number (1000553652616).
Almost surely, 22001107305231 is an apocalyptic number.
2001107305231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001107305231 is an equidigital number, since it uses as much as digits as its factorization.
2001107305231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 25.
The spelling of 2001107305231 in words is "two trillion, one billion, one hundred seven million, three hundred five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •