Base | Representation |
---|---|
bin | 111101000110101011… |
… | …0100100010000101111 |
3 | 110112200222120012002111 |
4 | 1322031112210100233 |
5 | 4122214423201111 |
6 | 140140515104451 |
7 | 12323524014424 |
oct | 1721526442057 |
9 | 415628505074 |
10 | 131220522031 |
11 | 50717622425 |
12 | 215215a2127 |
13 | c4b2a02c11 |
14 | 64cb61bd4b |
15 | 36300a4a21 |
hex | 1e8d5a442f |
131220522031 has 2 divisors, whose sum is σ = 131220522032. Its totient is φ = 131220522030.
The previous prime is 131220521983. The next prime is 131220522067. The reversal of 131220522031 is 130225022131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131220522031 - 27 = 131220521903 is a prime.
It is a super-3 number, since 3×1312205220313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 131220521993 and 131220522011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131220522091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65610261015 + 65610261016.
It is an arithmetic number, because the mean of its divisors is an integer number (65610261016).
Almost surely, 2131220522031 is an apocalyptic number.
131220522031 is a deficient number, since it is larger than the sum of its proper divisors (1).
131220522031 is an equidigital number, since it uses as much as digits as its factorization.
131220522031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 131220522031 its reverse (130225022131), we get a palindrome (261445544162).
The spelling of 131220522031 in words is "one hundred thirty-one billion, two hundred twenty million, five hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •