Base | Representation |
---|---|
bin | 1101111101110… |
… | …01011101111001 |
3 | 22011102220210111 |
4 | 12332321131321 |
5 | 214442322414 |
6 | 15342544321 |
7 | 2621525611 |
oct | 676713571 |
9 | 264386714 |
10 | 117151609 |
11 | 60146813 |
12 | 332980a1 |
13 | 1b36a5a3 |
14 | 117b7a41 |
15 | a4418c4 |
hex | 6fb9779 |
117151609 has 2 divisors, whose sum is σ = 117151610. Its totient is φ = 117151608.
The previous prime is 117151547. The next prime is 117151613. The reversal of 117151609 is 906151711.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105781225 + 11370384 = 10285^2 + 3372^2 .
It is an emirp because it is prime and its reverse (906151711) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 117151609 - 27 = 117151481 is a prime.
It is not a weakly prime, because it can be changed into another prime (117151649) 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, 58575804 + 58575805.
It is an arithmetic number, because the mean of its divisors is an integer number (58575805).
Almost surely, 2117151609 is an apocalyptic number.
It is an amenable number.
117151609 is a deficient number, since it is larger than the sum of its proper divisors (1).
117151609 is an equidigital number, since it uses as much as digits as its factorization.
117151609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 31.
The square root of 117151609 is about 10823.6596860766. The cubic root of 117151609 is about 489.3084914620.
The spelling of 117151609 in words is "one hundred seventeen million, one hundred fifty-one thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •