Base | Representation |
---|---|
bin | 1101111101000… |
… | …10111010100101 |
3 | 22011021020002022 |
4 | 12332202322211 |
5 | 214431343422 |
6 | 15340552525 |
7 | 2620662401 |
oct | 676427245 |
9 | 264236068 |
10 | 117059237 |
11 | 60093379 |
12 | 33252745 |
13 | 1b337529 |
14 | 11792101 |
15 | a424342 |
hex | 6fa2ea5 |
117059237 has 2 divisors, whose sum is σ = 117059238. Its totient is φ = 117059236.
The previous prime is 117059233. The next prime is 117059249. The reversal of 117059237 is 732950711.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105863521 + 11195716 = 10289^2 + 3346^2 .
It is an emirp because it is prime and its reverse (732950711) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 117059237 - 22 = 117059233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 117059197 and 117059206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (117059233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58529618 + 58529619.
It is an arithmetic number, because the mean of its divisors is an integer number (58529619).
Almost surely, 2117059237 is an apocalyptic number.
It is an amenable number.
117059237 is a deficient number, since it is larger than the sum of its proper divisors (1).
117059237 is an equidigital number, since it uses as much as digits as its factorization.
117059237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13230, while the sum is 35.
The square root of 117059237 is about 10819.3917111823. The cubic root of 117059237 is about 489.1798539101.
The spelling of 117059237 in words is "one hundred seventeen million, fifty-nine thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •