Base | Representation |
---|---|
bin | 10111011111011001000000… |
… | …110110010000001110001111 |
3 | 111112210112221000212100120021 |
4 | 113133121000312100032033 |
5 | 102020131422203131111 |
6 | 1003420552302403011 |
7 | 30522030254523463 |
oct | 2737310066201617 |
9 | 445715830770507 |
10 | 103312231302031 |
11 | 2aa11520253424 |
12 | b706729290467 |
13 | 45853bc83306b |
14 | 1b724a54784a3 |
15 | be25c53d1d71 |
hex | 5df640d9038f |
103312231302031 has 2 divisors, whose sum is σ = 103312231302032. Its totient is φ = 103312231302030.
The previous prime is 103312231301963. The next prime is 103312231302061. The reversal of 103312231302031 is 130203132213301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103312231302031 - 223 = 103312222913423 is a prime.
It is a super-2 number, since 2×1033122313020312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103312231301987 and 103312231302005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103312231302061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51656115651015 + 51656115651016.
It is an arithmetic number, because the mean of its divisors is an integer number (51656115651016).
Almost surely, 2103312231302031 is an apocalyptic number.
103312231302031 is a deficient number, since it is larger than the sum of its proper divisors (1).
103312231302031 is an equidigital number, since it uses as much as digits as its factorization.
103312231302031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 103312231302031 its reverse (130203132213301), we get a palindrome (233515363515332).
The spelling of 103312231302031 in words is "one hundred three trillion, three hundred twelve billion, two hundred thirty-one million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •