Base | Representation |
---|---|
bin | 11101100101010110100100… |
… | …010100100000010001100111 |
3 | 122001200102011121220001011221 |
4 | 131211112210110200101213 |
5 | 114023211142442324411 |
6 | 1140415445022441211 |
7 | 36256103035001101 |
oct | 3545264424402147 |
9 | 561612147801157 |
10 | 130110201136231 |
11 | 38503476636a28 |
12 | 1271428b133207 |
13 | 577a4546465c4 |
14 | 241b51dd7c571 |
15 | 10096e9172071 |
hex | 7655a4520467 |
130110201136231 has 2 divisors, whose sum is σ = 130110201136232. Its totient is φ = 130110201136230.
The previous prime is 130110201136177. The next prime is 130110201136271. The reversal of 130110201136231 is 132631102011031.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130110201136231 is a prime.
It is a super-2 number, since 2×1301102011362312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130110201136196 and 130110201136205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130110201136271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65055100568115 + 65055100568116.
It is an arithmetic number, because the mean of its divisors is an integer number (65055100568116).
Almost surely, 2130110201136231 is an apocalyptic number.
130110201136231 is a deficient number, since it is larger than the sum of its proper divisors (1).
130110201136231 is an equidigital number, since it uses as much as digits as its factorization.
130110201136231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 130110201136231 its reverse (132631102011031), we get a palindrome (262741303147262).
The spelling of 130110201136231 in words is "one hundred thirty trillion, one hundred ten billion, two hundred one million, one hundred thirty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •