Base | Representation |
---|---|
bin | 1101111101000… |
… | …01010101000001 |
3 | 22011020220011120 |
4 | 12332201111001 |
5 | 214431141422 |
6 | 15340502453 |
7 | 2620634424 |
oct | 676412501 |
9 | 264226146 |
10 | 117052737 |
11 | 600894aa |
12 | 3324aa29 |
13 | 1b334599 |
14 | 1178d9bb |
15 | a42245c |
hex | 6fa1541 |
117052737 has 4 divisors (see below), whose sum is σ = 156070320. Its totient is φ = 78035156.
The previous prime is 117052723. The next prime is 117052739. The reversal of 117052737 is 737250711.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 117052737 - 27 = 117052609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 117052698 and 117052707.
It is not an unprimeable number, because it can be changed into a prime (117052739) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19508787 + ... + 19508792.
It is an arithmetic number, because the mean of its divisors is an integer number (39017580).
Almost surely, 2117052737 is an apocalyptic number.
It is an amenable number.
117052737 is a deficient number, since it is larger than the sum of its proper divisors (39017583).
117052737 is an equidigital number, since it uses as much as digits as its factorization.
117052737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39017582.
The product of its (nonzero) digits is 10290, while the sum is 33.
The square root of 117052737 is about 10819.0913204391. The cubic root of 117052737 is about 489.1707994405.
The spelling of 117052737 in words is "one hundred seventeen million, fifty-two thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •