Base | Representation |
---|---|
bin | 111100101000100110… |
… | …0010110011111100001 |
3 | 110110002122100212222002 |
4 | 1321101030112133201 |
5 | 4113133032224413 |
6 | 135452422053345 |
7 | 12256520014355 |
oct | 1712114263741 |
9 | 413078325862 |
10 | 130211211233 |
11 | 5024991a274 |
12 | 2129b57a255 |
13 | c381885aac |
14 | 6433569465 |
15 | 35c1684958 |
hex | 1e513167e1 |
130211211233 has 2 divisors, whose sum is σ = 130211211234. Its totient is φ = 130211211232.
The previous prime is 130211211227. The next prime is 130211211239. The reversal of 130211211233 is 332112112031.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (130211211227) and next prime (130211211239).
It can be written as a sum of positive squares in only one way, i.e., 121342845649 + 8868365584 = 348343^2 + 94172^2 .
It is a cyclic number.
It is not a de Polignac number, because 130211211233 - 210 = 130211210209 is a prime.
It is not a weakly prime, because it can be changed into another prime (130211211239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65105605616 + 65105605617.
It is an arithmetic number, because the mean of its divisors is an integer number (65105605617).
Almost surely, 2130211211233 is an apocalyptic number.
It is an amenable number.
130211211233 is a deficient number, since it is larger than the sum of its proper divisors (1).
130211211233 is an equidigital number, since it uses as much as digits as its factorization.
130211211233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 130211211233 its reverse (332112112031), we get a palindrome (462323323264).
The spelling of 130211211233 in words is "one hundred thirty billion, two hundred eleven million, two hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •