Base | Representation |
---|---|
bin | 1011111010100101110110… |
… | …0100100010101100111011 |
3 | 1201101110112120000001012101 |
4 | 2332221131210202230323 |
5 | 3204122244322110321 |
6 | 43510341210524231 |
7 | 2521350306355306 |
oct | 276513544425473 |
9 | 51343476001171 |
10 | 13101220113211 |
11 | 41a1218229a1a |
12 | 1577130136677 |
13 | 7405941b2129 |
14 | 33416112db3d |
15 | 17abd5a81791 |
hex | bea5d922b3b |
13101220113211 has 2 divisors, whose sum is σ = 13101220113212. Its totient is φ = 13101220113210.
The previous prime is 13101220113187. The next prime is 13101220113227. The reversal of 13101220113211 is 11231102210131.
It is a strong prime.
It is an emirp because it is prime and its reverse (11231102210131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13101220113211 is a prime.
It is not a weakly prime, because it can be changed into another prime (13101220113251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550610056605 + 6550610056606.
It is an arithmetic number, because the mean of its divisors is an integer number (6550610056606).
Almost surely, 213101220113211 is an apocalyptic number.
13101220113211 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101220113211 is an equidigital number, since it uses as much as digits as its factorization.
13101220113211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 13101220113211 its reverse (11231102210131), we get a palindrome (24332322323342).
The spelling of 13101220113211 in words is "thirteen trillion, one hundred one billion, two hundred twenty million, one hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •