Base | Representation |
---|---|
bin | 11010101001101001111101… |
… | …110001111100111001001001 |
3 | 120101000100001121220022011002 |
4 | 122221221331301330321021 |
5 | 110330344200021114223 |
6 | 1053142202011144345 |
7 | 33455161605142511 |
oct | 3251517561747111 |
9 | 511010047808132 |
10 | 117211767754313 |
11 | 34390260213721 |
12 | 11190513a450b5 |
13 | 5053039c1628b |
14 | 20d311909c841 |
15 | d83e3152ce28 |
hex | 6a9a7dc7ce49 |
117211767754313 has 2 divisors, whose sum is σ = 117211767754314. Its totient is φ = 117211767754312.
The previous prime is 117211767754309. The next prime is 117211767754343. The reversal of 117211767754313 is 313457767112711.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113381437317184 + 3830330437129 = 10648072^2 + 1957123^2 .
It is a cyclic number.
It is not a de Polignac number, because 117211767754313 - 22 = 117211767754309 is a prime.
It is a super-2 number, since 2×1172117677543132 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (117211767754343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58605883877156 + 58605883877157.
It is an arithmetic number, because the mean of its divisors is an integer number (58605883877157).
Almost surely, 2117211767754313 is an apocalyptic number.
It is an amenable number.
117211767754313 is a deficient number, since it is larger than the sum of its proper divisors (1).
117211767754313 is an equidigital number, since it uses as much as digits as its factorization.
117211767754313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5186160, while the sum is 56.
The spelling of 117211767754313 in words is "one hundred seventeen trillion, two hundred eleven billion, seven hundred sixty-seven million, seven hundred fifty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •