Base | Representation |
---|---|
bin | 1110000000001… |
… | …10111111000000 |
3 | 22012001001100011 |
4 | 13000012333000 |
5 | 220033002440 |
6 | 15353434304 |
7 | 2624320366 |
oct | 700067700 |
9 | 265031304 |
10 | 117469120 |
11 | 6034331a |
12 | 3340b994 |
13 | 1b44bc72 |
14 | 1185b636 |
15 | a4a59ea |
hex | 7006fc0 |
117469120 has 56 divisors (see below), whose sum is σ = 286262064. Its totient is φ = 45889536.
The previous prime is 117469097. The next prime is 117469151. The reversal of 117469120 is 21964711.
It is a congruent number.
It is an unprimeable number.
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, 9492 + ... + 18028.
Almost surely, 2117469120 is an apocalyptic number.
117469120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117469120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143131032).
117469120 is an abundant number, since it is smaller than the sum of its proper divisors (168792944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117469120 is an equidigital number, since it uses as much as digits as its factorization.
117469120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8597 (or 8587 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 31.
The square root of 117469120 is about 10838.3172125566. The cubic root of 117469120 is about 489.7501433374.
It can be divided in two parts, 1174691 and 20, that added together give a palindrome (1174711).
The spelling of 117469120 in words is "one hundred seventeen million, four hundred sixty-nine thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •