Base | Representation |
---|---|
bin | 1101111101110… |
… | …01110010101100 |
3 | 22011102222121210 |
4 | 12332321302230 |
5 | 214442343230 |
6 | 15342554420 |
7 | 2621532522 |
oct | 676716254 |
9 | 264388553 |
10 | 117152940 |
11 | 60147813 |
12 | 33298a10 |
13 | 1b36b088 |
14 | 117b8312 |
15 | a441eb0 |
hex | 6fb9cac |
117152940 has 48 divisors (see below), whose sum is σ = 333416160. Its totient is φ = 30727680.
The previous prime is 117152891. The next prime is 117152951. The reversal of 117152940 is 49251711.
It is a super-2 number, since 2×1171529402 = 27449622701287200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 117152898 and 117152907.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12345 + ... + 19664.
It is an arithmetic number, because the mean of its divisors is an integer number (6946170).
Almost surely, 2117152940 is an apocalyptic number.
117152940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
117152940 is an abundant number, since it is smaller than the sum of its proper divisors (216263220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117152940 is a wasteful number, since it uses less digits than its factorization.
117152940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32082 (or 32080 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 30.
The square root of 117152940 is about 10823.7211715750. The cubic root of 117152940 is about 489.3103445228.
The spelling of 117152940 in words is "one hundred seventeen million, one hundred fifty-two thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •