Base | Representation |
---|---|
bin | 1110000001010… |
… | …11000011000101 |
3 | 22012022112222011 |
4 | 13000223003011 |
5 | 220102214322 |
6 | 15400534221 |
7 | 2625504142 |
oct | 700530305 |
9 | 265275864 |
10 | 117616837 |
11 | 604342a8 |
12 | 33481371 |
13 | 1b4a1280 |
14 | 118993c9 |
15 | a4d4677 |
hex | 702b0c5 |
117616837 has 8 divisors (see below), whose sum is σ = 131032440. Its totient is φ = 104825280.
The previous prime is 117616819. The next prime is 117616847. The reversal of 117616837 is 738616711.
It can be written as a sum of positive squares in 4 ways, for example, as 3682561 + 113934276 = 1919^2 + 10674^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 117616837 - 215 = 117584069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 117616837.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117616817) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 155614 + ... + 156367.
It is an arithmetic number, because the mean of its divisors is an integer number (16379055).
Almost surely, 2117616837 is an apocalyptic number.
It is an amenable number.
117616837 is a deficient number, since it is larger than the sum of its proper divisors (13415603).
117616837 is a wasteful number, since it uses less digits than its factorization.
117616837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312023.
The product of its digits is 42336, while the sum is 40.
The square root of 117616837 is about 10845.1296442228. The cubic root of 117616837 is about 489.9553437021.
The spelling of 117616837 in words is "one hundred seventeen million, six hundred sixteen thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •