Base | Representation |
---|---|
bin | 1001000111111000011000… |
… | …1101001010000001011111 |
3 | 1022111221202122122012121021 |
4 | 2101332012031022001133 |
5 | 2303321442024411111 |
6 | 33200102231345011 |
7 | 2053500352101442 |
oct | 221760615120137 |
9 | 38457678565537 |
10 | 10031000232031 |
11 | 321813a13a199 |
12 | 11600a9822167 |
13 | 579bc480c29c |
14 | 269708345659 |
15 | 125de1796d71 |
hex | 91f8634a05f |
10031000232031 has 2 divisors, whose sum is σ = 10031000232032. Its totient is φ = 10031000232030.
The previous prime is 10031000231983. The next prime is 10031000232037. The reversal of 10031000232031 is 13023200013001.
It is a strong prime.
It is an emirp because it is prime and its reverse (13023200013001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10031000232031 - 29 = 10031000231519 is a prime.
It is a super-2 number, since 2×100310002320312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10031000231996 and 10031000232014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10031000232037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5015500116015 + 5015500116016.
It is an arithmetic number, because the mean of its divisors is an integer number (5015500116016).
Almost surely, 210031000232031 is an apocalyptic number.
10031000232031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10031000232031 is an equidigital number, since it uses as much as digits as its factorization.
10031000232031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10031000232031 its reverse (13023200013001), we get a palindrome (23054200245032).
The spelling of 10031000232031 in words is "ten trillion, thirty-one billion, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •