Base | Representation |
---|---|
bin | 10111000010001001111000… |
… | …000001100001110100001111 |
3 | 111021200111001002000201020202 |
4 | 113002021320001201310033 |
5 | 101234222233222410111 |
6 | 555242001330004115 |
7 | 30223623363052052 |
oct | 2702117001416417 |
9 | 437614032021222 |
10 | 101303112310031 |
11 | 2a307454a28a15 |
12 | b44127b41663b |
13 | 446aac4c88548 |
14 | 1b0314d87aa99 |
15 | baa1d6a70b3b |
hex | 5c2278061d0f |
101303112310031 has 2 divisors, whose sum is σ = 101303112310032. Its totient is φ = 101303112310030.
The previous prime is 101303112309859. The next prime is 101303112310069. The reversal of 101303112310031 is 130013211303101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101303112310031 - 226 = 101303045201167 is a prime.
It is a super-2 number, since 2×1013031123100312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101303112309985 and 101303112310012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101303112310331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50651556155015 + 50651556155016.
It is an arithmetic number, because the mean of its divisors is an integer number (50651556155016).
Almost surely, 2101303112310031 is an apocalyptic number.
101303112310031 is a deficient number, since it is larger than the sum of its proper divisors (1).
101303112310031 is an equidigital number, since it uses as much as digits as its factorization.
101303112310031 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 20.
Adding to 101303112310031 its reverse (130013211303101), we get a palindrome (231316323613132).
The spelling of 101303112310031 in words is "one hundred one trillion, three hundred three billion, one hundred twelve million, three hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •