Base | Representation |
---|---|
bin | 11001111111011011110111… |
… | …011001101101111110101111 |
3 | 112222201222011001001001220021 |
4 | 121333123313121231332233 |
5 | 104440330210021030111 |
6 | 1043041251052303011 |
7 | 33035440350014626 |
oct | 3177336731557657 |
9 | 488658131031807 |
10 | 114310410330031 |
11 | 334718556240a3 |
12 | 109a2159171a67 |
13 | 4ba256b903396 |
14 | 2032920c386bd |
15 | d33721c8dd71 |
hex | 67f6f766dfaf |
114310410330031 has 2 divisors, whose sum is σ = 114310410330032. Its totient is φ = 114310410330030.
The previous prime is 114310410329933. The next prime is 114310410330041. The reversal of 114310410330031 is 130033014013411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114310410330031 - 223 = 114310401941423 is a prime.
It is a super-2 number, since 2×1143104103300312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114310410329978 and 114310410330005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114310410330041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57155205165015 + 57155205165016.
It is an arithmetic number, because the mean of its divisors is an integer number (57155205165016).
Almost surely, 2114310410330031 is an apocalyptic number.
114310410330031 is a deficient number, since it is larger than the sum of its proper divisors (1).
114310410330031 is an equidigital number, since it uses as much as digits as its factorization.
114310410330031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 114310410330031 its reverse (130033014013411), we get a palindrome (244343424343442).
The spelling of 114310410330031 in words is "one hundred fourteen trillion, three hundred ten billion, four hundred ten million, three hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •