Base | Representation |
---|---|
bin | 1101111110010… |
… | …00000111011000 |
3 | 22011112222002200 |
4 | 12333020013120 |
5 | 220001232413 |
6 | 15344130200 |
7 | 2622165543 |
oct | 677100730 |
9 | 264488080 |
10 | 117211608 |
11 | 601878a8 |
12 | 33306960 |
13 | 1b38b9a7 |
14 | 117d185a |
15 | a454573 |
hex | 6fc81d8 |
117211608 has 96 divisors (see below), whose sum is σ = 341452800. Its totient is φ = 36206784.
The previous prime is 117211571. The next prime is 117211613. The reversal of 117211608 is 806112711.
It is a super-2 number, since 2×1172116082 = 27477122099891328, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 63385 + ... + 65207.
It is an arithmetic number, because the mean of its divisors is an integer number (3556800).
Almost surely, 2117211608 is an apocalyptic number.
117211608 is a gapful number since it is divisible by the number (18) 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 117211608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170726400).
117211608 is an abundant number, since it is smaller than the sum of its proper divisors (224241192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117211608 is a wasteful number, since it uses less digits than its factorization.
117211608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1901 (or 1894 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 27.
The square root of 117211608 is about 10826.4309908668. The cubic root of 117211608 is about 489.3920100467.
The spelling of 117211608 in words is "one hundred seventeen million, two hundred eleven thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •