Base | Representation |
---|---|
bin | 111101000110101110… |
… | …1011011111101010111 |
3 | 110112201002221200121012 |
4 | 1322031131123331113 |
5 | 4122220403314111 |
6 | 140141021442435 |
7 | 12323545225232 |
oct | 1721535337527 |
9 | 415632850535 |
10 | 131222323031 |
11 | 50718642558 |
12 | 2152211041b |
13 | c4b31b38b7 |
14 | 64cb96a419 |
15 | 363030d48b |
hex | 1e8d75bf57 |
131222323031 has 2 divisors, whose sum is σ = 131222323032. Its totient is φ = 131222323030.
The previous prime is 131222323013. The next prime is 131222323051. The reversal of 131222323031 is 130323222131.
Together with previous prime (131222323013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131222323031 - 26 = 131222322967 is a prime.
It is a super-2 number, since 2×1312223230312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 131222322988 and 131222323006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131222323051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65611161515 + 65611161516.
It is an arithmetic number, because the mean of its divisors is an integer number (65611161516).
Almost surely, 2131222323031 is an apocalyptic number.
131222323031 is a deficient number, since it is larger than the sum of its proper divisors (1).
131222323031 is an equidigital number, since it uses as much as digits as its factorization.
131222323031 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 23.
Adding to 131222323031 its reverse (130323222131), we get a palindrome (261545545162).
The spelling of 131222323031 in words is "one hundred thirty-one billion, two hundred twenty-two million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •