Base | Representation |
---|---|
bin | 10111010000110100110101… |
… | …011101111100011001011111 |
3 | 111102020212101022111100120001 |
4 | 113100310311131330121133 |
5 | 101402232032112000111 |
6 | 1001333100205435131 |
7 | 30356514466401232 |
oct | 2720646535743137 |
9 | 442225338440501 |
10 | 102311313000031 |
11 | 2a665a90a35663 |
12 | b58474b86baa7 |
13 | 4511bb9233575 |
14 | 1b39c730ad419 |
15 | bc65432261c1 |
hex | 5d0d3577c65f |
102311313000031 has 2 divisors, whose sum is σ = 102311313000032. Its totient is φ = 102311313000030.
The previous prime is 102311312999969. The next prime is 102311313000119. The reversal of 102311313000031 is 130000313113201.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102311313000031 is a prime.
It is a super-2 number, since 2×1023113130000312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102311312999972 and 102311313000008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102311313090031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51155656500015 + 51155656500016.
It is an arithmetic number, because the mean of its divisors is an integer number (51155656500016).
Almost surely, 2102311313000031 is an apocalyptic number.
102311313000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
102311313000031 is an equidigital number, since it uses as much as digits as its factorization.
102311313000031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 102311313000031 its reverse (130000313113201), we get a palindrome (232311626113232).
The spelling of 102311313000031 in words is "one hundred two trillion, three hundred eleven billion, three hundred thirteen million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •