Base | Representation |
---|---|
bin | 11101101000010000110110… |
… | …100100001101100110101011 |
3 | 122002101112110111201212022122 |
4 | 131220100312210031212223 |
5 | 114040000314121120321 |
6 | 1141051405022141455 |
7 | 36306413544455453 |
oct | 3550206644154653 |
9 | 562345414655278 |
10 | 130310223223211 |
11 | 38580289913429 |
12 | 12746bb212188b |
13 | 57932803c9aa5 |
14 | 2427096d6cd63 |
15 | 100ea0450a8ab |
hex | 76843690d9ab |
130310223223211 has 2 divisors, whose sum is σ = 130310223223212. Its totient is φ = 130310223223210.
The previous prime is 130310223223111. The next prime is 130310223223241. The reversal of 130310223223211 is 112322322013031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130310223223211 - 218 = 130310222961067 is a prime.
It is not a weakly prime, because it can be changed into another prime (130310223223241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65155111611605 + 65155111611606.
It is an arithmetic number, because the mean of its divisors is an integer number (65155111611606).
Almost surely, 2130310223223211 is an apocalyptic number.
130310223223211 is a deficient number, since it is larger than the sum of its proper divisors (1).
130310223223211 is an equidigital number, since it uses as much as digits as its factorization.
130310223223211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 130310223223211 its reverse (112322322013031), we get a palindrome (242632545236242).
The spelling of 130310223223211 in words is "one hundred thirty trillion, three hundred ten billion, two hundred twenty-three million, two hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •