Base | Representation |
---|---|
bin | 11101100101100001100100… |
… | …011000011010111100010111 |
3 | 122001201112122211121022020221 |
4 | 131211201210120122330113 |
5 | 114023404340402314111 |
6 | 1140425121102535211 |
7 | 36260001535635352 |
oct | 3545414430327427 |
9 | 561645584538227 |
10 | 130122013323031 |
11 | 38508488279784 |
12 | 12716626b97507 |
13 | 577b5b78ccb52 |
14 | 241bd20a6b299 |
15 | 1009b8b194371 |
hex | 76586461af17 |
130122013323031 has 2 divisors, whose sum is σ = 130122013323032. Its totient is φ = 130122013323030.
The previous prime is 130122013322963. The next prime is 130122013323121. The reversal of 130122013323031 is 130323310221031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130122013323031 - 221 = 130122011225879 is a prime.
It is a super-2 number, since 2×1301220133230312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130122013322987 and 130122013323005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130122013323431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65061006661515 + 65061006661516.
It is an arithmetic number, because the mean of its divisors is an integer number (65061006661516).
Almost surely, 2130122013323031 is an apocalyptic number.
130122013323031 is a deficient number, since it is larger than the sum of its proper divisors (1).
130122013323031 is an equidigital number, since it uses as much as digits as its factorization.
130122013323031 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 130122013323031 its reverse (130323310221031), we get a palindrome (260445323544062).
The spelling of 130122013323031 in words is "one hundred thirty trillion, one hundred twenty-two billion, thirteen million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •