Base | Representation |
---|---|
bin | 1101111101101… |
… | …01111110110000 |
3 | 22011102012012120 |
4 | 12332311332300 |
5 | 214441343303 |
6 | 15342354240 |
7 | 2621436150 |
oct | 676657660 |
9 | 264365176 |
10 | 117137328 |
11 | 60137010 |
12 | 3328b980 |
13 | 1b363c39 |
14 | 117b2760 |
15 | a43c553 |
hex | 6fb5fb0 |
117137328 has 160 divisors (see below), whose sum is σ = 386975232. Its totient is φ = 29644800.
The previous prime is 117137309. The next prime is 117137341. The reversal of 117137328 is 823731711.
It is a Cunningham number, because it is equal to 108232-1.
It is a super-2 number, since 2×1171373282 = 27442307221959168, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a nude number because it is divisible by every one of its digits.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 151150 + ... + 151922.
Almost surely, 2117137328 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117137328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193487616).
117137328 is an abundant number, since it is smaller than the sum of its proper divisors (269837904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117137328 is a wasteful number, since it uses less digits than its factorization.
117137328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 843 (or 837 counting only the distinct ones).
The product of its digits is 7056, while the sum is 33.
The square root of 117137328 is about 10822.9999538021. Note that the first 4 decimals coincide. The cubic root of 117137328 is about 489.2886081143.
The spelling of 117137328 in words is "one hundred seventeen million, one hundred thirty-seven thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •