Base | Representation |
---|---|
bin | 100110101001001110100… |
… | …0101100101100000011001 |
3 | 200210202011201011111021021 |
4 | 1031102131011211200121 |
5 | 1144004332024040423 |
6 | 15143534415242441 |
7 | 1055502601111366 |
oct | 115223505454031 |
9 | 20722151144237 |
10 | 5311215065113 |
11 | 1768523494211 |
12 | 719423219421 |
13 | 2c6acb54a979 |
14 | 1450c817d46d |
15 | 932547a295d |
hex | 4d49d165819 |
5311215065113 has 2 divisors, whose sum is σ = 5311215065114. Its totient is φ = 5311215065112.
The previous prime is 5311215065071. The next prime is 5311215065131. The reversal of 5311215065113 is 3115605121135.
Together with next prime (5311215065131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4609252604889 + 701962460224 = 2146917^2 + 837832^2 .
It is a cyclic number.
It is not a de Polignac number, because 5311215065113 - 217 = 5311214934041 is a prime.
It is not a weakly prime, because it can be changed into another prime (5311215465113) 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, 2655607532556 + 2655607532557.
It is an arithmetic number, because the mean of its divisors is an integer number (2655607532557).
Almost surely, 25311215065113 is an apocalyptic number.
It is an amenable number.
5311215065113 is a deficient number, since it is larger than the sum of its proper divisors (1).
5311215065113 is an equidigital number, since it uses as much as digits as its factorization.
5311215065113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 34.
The spelling of 5311215065113 in words is "five trillion, three hundred eleven billion, two hundred fifteen million, sixty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •