Base | Representation |
---|---|
bin | 1101111111010… |
… | …10101011000000 |
3 | 22011211011021001 |
4 | 12333222223000 |
5 | 220020300102 |
6 | 15351141344 |
7 | 2623325320 |
oct | 677525300 |
9 | 264734231 |
10 | 117353152 |
11 | 60274184 |
12 | 33374854 |
13 | 1b40b247 |
14 | 1182b280 |
15 | a481487 |
hex | 6feaac0 |
117353152 has 56 divisors (see below), whose sum is σ = 272674080. Its totient is φ = 49059840.
The previous prime is 117353141. The next prime is 117353161. The reversal of 117353152 is 251353711.
It is a tau number, because it is divible by the number of its divisors (56).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 117353152.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15174 + ... + 21562.
It is an arithmetic number, because the mean of its divisors is an integer number (4869180).
Almost surely, 2117353152 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 117353152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136337040).
117353152 is an abundant number, since it is smaller than the sum of its proper divisors (155320928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117353152 is an equidigital number, since it uses as much as digits as its factorization.
117353152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6449 (or 6439 counting only the distinct ones).
The product of its digits is 3150, while the sum is 28.
The square root of 117353152 is about 10832.9659835153. The cubic root of 117353152 is about 489.5889263732.
The spelling of 117353152 in words is "one hundred seventeen million, three hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •