Base | Representation |
---|---|
bin | 100001011110111110011… |
… | …101111110001010111111 |
3 | 22010222021212011010220001 |
4 | 201132332131332022333 |
5 | 300144423233444411 |
6 | 4521022144335131 |
7 | 325146000024622 |
oct | 41367635761277 |
9 | 8128255133801 |
10 | 2301003031231 |
11 | 807939251313 |
12 | 311b493144a7 |
13 | 138ca3121a88 |
14 | 7d524ccbdb9 |
15 | 3ecc376adc1 |
hex | 217be77e2bf |
2301003031231 has 2 divisors, whose sum is σ = 2301003031232. Its totient is φ = 2301003031230.
The previous prime is 2301003031213. The next prime is 2301003031267. The reversal of 2301003031231 is 1321303001032.
Together with previous prime (2301003031213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2301003031231 - 241 = 101979775679 is a prime.
It is a super-2 number, since 2×23010030312312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2301003031199 and 2301003031208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2301003041231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150501515615 + 1150501515616.
It is an arithmetic number, because the mean of its divisors is an integer number (1150501515616).
Almost surely, 22301003031231 is an apocalyptic number.
2301003031231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2301003031231 is an equidigital number, since it uses as much as digits as its factorization.
2301003031231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 2301003031231 its reverse (1321303001032), we get a palindrome (3622306032263).
The spelling of 2301003031231 in words is "two trillion, three hundred one billion, three million, thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •