Base | Representation |
---|---|
bin | 110110011111001011… |
… | …1100000010101101101 |
3 | 102012000122211120000210 |
4 | 1230332113200111231 |
5 | 3404114134404112 |
6 | 125430500213033 |
7 | 11311425360204 |
oct | 1547627402555 |
9 | 365018746023 |
10 | 117010466157 |
11 | 456953a30a2 |
12 | 1a81669a179 |
13 | b059a28930 |
14 | 59402a623b |
15 | 309c7ccb3c |
hex | 1b3e5e056d |
117010466157 has 8 divisors (see below), whose sum is σ = 168015028384. Its totient is φ = 72006440688.
The previous prime is 117010466123. The next prime is 117010466159. The reversal of 117010466157 is 751664010711.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 117010466157 - 228 = 116742030701 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 3000268363 = 117010466157 / (1 + 1 + 7 + 0 + 1 + 0 + 4 + 6 + 6 + 1 + 5 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117010466159) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1500134143 + ... + 1500134220.
It is an arithmetic number, because the mean of its divisors is an integer number (21001878548).
Almost surely, 2117010466157 is an apocalyptic number.
It is an amenable number.
117010466157 is a deficient number, since it is larger than the sum of its proper divisors (51004562227).
117010466157 is a wasteful number, since it uses less digits than its factorization.
117010466157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3000268379.
The product of its (nonzero) digits is 35280, while the sum is 39.
Adding to 117010466157 its reverse (751664010711), we get a palindrome (868674476868).
The spelling of 117010466157 in words is "one hundred seventeen billion, ten million, four hundred sixty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •