Base | Representation |
---|---|
bin | 100101001100111111001… |
… | …1000000100011101111011 |
3 | 200002210212220122200221221 |
4 | 1022121332120010131323 |
5 | 1132233143104234321 |
6 | 14512535021212511 |
7 | 1035261106061014 |
oct | 112317630043573 |
9 | 20083786580857 |
10 | 5113131321211 |
11 | 16a1515371641 |
12 | 6a6b61401137 |
13 | 2b1221234654 |
14 | 13969679800b |
15 | 8d00e69ce41 |
hex | 4a67e60477b |
5113131321211 has 2 divisors, whose sum is σ = 5113131321212. Its totient is φ = 5113131321210.
The previous prime is 5113131321173. The next prime is 5113131321223. The reversal of 5113131321211 is 1121231313115.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5113131321211 - 29 = 5113131320699 is a prime.
It is a super-2 number, since 2×51131313212112 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5113131321811) 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, 2556565660605 + 2556565660606.
It is an arithmetic number, because the mean of its divisors is an integer number (2556565660606).
Almost surely, 25113131321211 is an apocalyptic number.
5113131321211 is a deficient number, since it is larger than the sum of its proper divisors (1).
5113131321211 is an equidigital number, since it uses as much as digits as its factorization.
5113131321211 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 540, while the sum is 25.
Adding to 5113131321211 its reverse (1121231313115), we get a palindrome (6234362634326).
The spelling of 5113131321211 in words is "five trillion, one hundred thirteen billion, one hundred thirty-one million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •