Base | Representation |
---|---|
bin | 1110000000010… |
… | …10000010110010 |
3 | 22012001200112020 |
4 | 13000022002302 |
5 | 220033403100 |
6 | 15354012310 |
7 | 2624402046 |
oct | 700120262 |
9 | 265050466 |
10 | 117481650 |
11 | 60351780 |
12 | 33417096 |
13 | 1b454890 |
14 | 11862026 |
15 | a4a95a0 |
hex | 700a0b2 |
117481650 has 96 divisors (see below), whose sum is σ = 342353088. Its totient is φ = 26284800.
The previous prime is 117481627. The next prime is 117481657. The reversal of 117481650 is 56184711.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (117481657) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18712 + ... + 24188.
It is an arithmetic number, because the mean of its divisors is an integer number (3566178).
Almost surely, 2117481650 is an apocalyptic number.
117481650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 117481650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171176544).
117481650 is an abundant number, since it is smaller than the sum of its proper divisors (224871438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117481650 is a wasteful number, since it uses less digits than its factorization.
117481650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5516 (or 5511 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 33.
The square root of 117481650 is about 10838.8952389070. The cubic root of 117481650 is about 489.7675560019.
The spelling of 117481650 in words is "one hundred seventeen million, four hundred eighty-one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •