Base | Representation |
---|---|
bin | 11101100101010111010100… |
… | …101110011001101011011111 |
3 | 122001200111021012222202020002 |
4 | 131211113110232121223133 |
5 | 114023214323341400302 |
6 | 1140420101352444515 |
7 | 36256132125461222 |
oct | 3545272456315337 |
9 | 561614235882202 |
10 | 130111013231327 |
11 | 38503852a88aa7 |
12 | 127144770a973b |
13 | 577a55397284b |
14 | 241b599b755b9 |
15 | 10097455d7c02 |
hex | 7655d4b99adf |
130111013231327 has 2 divisors, whose sum is σ = 130111013231328. Its totient is φ = 130111013231326.
The previous prime is 130111013231323. The next prime is 130111013231351. The reversal of 130111013231327 is 723132310111031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130111013231327 - 22 = 130111013231323 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130111013231327.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130111013231323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65055506615663 + 65055506615664.
It is an arithmetic number, because the mean of its divisors is an integer number (65055506615664).
Almost surely, 2130111013231327 is an apocalyptic number.
130111013231327 is a deficient number, since it is larger than the sum of its proper divisors (1).
130111013231327 is an equidigital number, since it uses as much as digits as its factorization.
130111013231327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 29.
Adding to 130111013231327 its reverse (723132310111031), we get a palindrome (853243323342358).
The spelling of 130111013231327 in words is "one hundred thirty trillion, one hundred eleven billion, thirteen million, two hundred thirty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •