Base | Representation |
---|---|
bin | 1110000001110… |
… | …00001010000001 |
3 | 22012102021121202 |
4 | 13000320022001 |
5 | 220110424104 |
6 | 15402030545 |
7 | 2626116524 |
oct | 700701201 |
9 | 265367552 |
10 | 117670529 |
11 | 60470679 |
12 | 334a8455 |
13 | 1b4bc842 |
14 | 118b0bbb |
15 | a4e551e |
hex | 7038281 |
117670529 has 2 divisors, whose sum is σ = 117670530. Its totient is φ = 117670528.
The previous prime is 117670493. The next prime is 117670541. The reversal of 117670529 is 925076711.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105103504 + 12567025 = 10252^2 + 3545^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-117670529 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 117670492 and 117670501.
It is not a weakly prime, because it can be changed into another prime (117676529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58835264 + 58835265.
It is an arithmetic number, because the mean of its divisors is an integer number (58835265).
Almost surely, 2117670529 is an apocalyptic number.
It is an amenable number.
117670529 is a deficient number, since it is larger than the sum of its proper divisors (1).
117670529 is an equidigital number, since it uses as much as digits as its factorization.
117670529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 38.
The square root of 117670529 is about 10847.6047586552. The cubic root of 117670529 is about 490.0298871122.
The spelling of 117670529 in words is "one hundred seventeen million, six hundred seventy thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •