Base | Representation |
---|---|
bin | 110110101000000010… |
… | …1001100010111101001 |
3 | 102012210101001100101022 |
4 | 1231100011030113221 |
5 | 3410221224440112 |
6 | 125520154102225 |
7 | 11321664422663 |
oct | 1552005142751 |
9 | 365711040338 |
10 | 117307655657 |
11 | 45828127a55 |
12 | 1a89a11a975 |
13 | b0a64813ca |
14 | 596b947533 |
15 | 30b8933d72 |
hex | 1b5014c5e9 |
117307655657 has 2 divisors, whose sum is σ = 117307655658. Its totient is φ = 117307655656.
The previous prime is 117307655639. The next prime is 117307655669. The reversal of 117307655657 is 756556703711.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93149481616 + 24158174041 = 305204^2 + 155429^2 .
It is a cyclic number.
It is not a de Polignac number, because 117307655657 - 212 = 117307651561 is a prime.
It is a super-2 number, since 2×1173076556572 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 117307655599 and 117307655608.
It is not a weakly prime, because it can be changed into another prime (117307655687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58653827828 + 58653827829.
It is an arithmetic number, because the mean of its divisors is an integer number (58653827829).
Almost surely, 2117307655657 is an apocalyptic number.
It is an amenable number.
117307655657 is a deficient number, since it is larger than the sum of its proper divisors (1).
117307655657 is an equidigital number, since it uses as much as digits as its factorization.
117307655657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4630500, while the sum is 53.
The spelling of 117307655657 in words is "one hundred seventeen billion, three hundred seven million, six hundred fifty-five thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •