Base | Representation |
---|---|
bin | 11101100111001001000010… |
… | …110111001001011011110011 |
3 | 122002010011110001121111010112 |
4 | 131213021002313021123303 |
5 | 114032214412221232011 |
6 | 1140552134110451535 |
7 | 36301014056655134 |
oct | 3547110267113363 |
9 | 562104401544115 |
10 | 130233120102131 |
11 | 38550613144362 |
12 | 12734074503bab |
13 | 5788c134b2217 |
14 | 2423460c35c8b |
15 | 100c9e051158b |
hex | 767242dc96f3 |
130233120102131 has 2 divisors, whose sum is σ = 130233120102132. Its totient is φ = 130233120102130.
The previous prime is 130233120102091. The next prime is 130233120102149. The reversal of 130233120102131 is 131201021332031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130233120102131 - 242 = 125835073591027 is a prime.
It is a super-2 number, since 2×1302331201021312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130233120102097 and 130233120102106.
It is not a weakly prime, because it can be changed into another prime (130233120102331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65116560051065 + 65116560051066.
It is an arithmetic number, because the mean of its divisors is an integer number (65116560051066).
Almost surely, 2130233120102131 is an apocalyptic number.
130233120102131 is a deficient number, since it is larger than the sum of its proper divisors (1).
130233120102131 is an equidigital number, since it uses as much as digits as its factorization.
130233120102131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 130233120102131 its reverse (131201021332031), we get a palindrome (261434141434162).
The spelling of 130233120102131 in words is "one hundred thirty trillion, two hundred thirty-three billion, one hundred twenty million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •