Base | Representation |
---|---|
bin | 11101100110110110010101… |
… | …100101101100111001001111 |
3 | 122002001020121011120012020221 |
4 | 131212312111211230321033 |
5 | 114031402242444414411 |
6 | 1140535012554452211 |
7 | 36266403231063631 |
oct | 3546662545547117 |
9 | 562036534505227 |
10 | 130213033201231 |
11 | 38543045660412 |
12 | 127301a9434067 |
13 | 5787061acc146 |
14 | 24224b71aca51 |
15 | 100c216d2c071 |
hex | 766d9596ce4f |
130213033201231 has 2 divisors, whose sum is σ = 130213033201232. Its totient is φ = 130213033201230.
The previous prime is 130213033201193. The next prime is 130213033201301. The reversal of 130213033201231 is 132102330312031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130213033201231 - 223 = 130213024812623 is a prime.
It is a super-2 number, since 2×1302130332012312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130213033201196 and 130213033201205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130213033201631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65106516600615 + 65106516600616.
It is an arithmetic number, because the mean of its divisors is an integer number (65106516600616).
Almost surely, 2130213033201231 is an apocalyptic number.
130213033201231 is a deficient number, since it is larger than the sum of its proper divisors (1).
130213033201231 is an equidigital number, since it uses as much as digits as its factorization.
130213033201231 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 130213033201231 its reverse (132102330312031), we get a palindrome (262315363513262).
The spelling of 130213033201231 in words is "one hundred thirty trillion, two hundred thirteen billion, thirty-three million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •