Base | Representation |
---|---|
bin | 1101111101000… |
… | …00110101110100 |
3 | 22011020210102121 |
4 | 12332200311310 |
5 | 214431110430 |
6 | 15340445324 |
7 | 2620625542 |
oct | 676406564 |
9 | 264223377 |
10 | 117050740 |
11 | 60087a54 |
12 | 33249844 |
13 | 1b3336c1 |
14 | 1178cd92 |
15 | a421a7a |
hex | 6fa0d74 |
117050740 has 24 divisors (see below), whose sum is σ = 248066280. Its totient is φ = 46389888.
The previous prime is 117050737. The next prime is 117050743. The reversal of 117050740 is 47050711.
It is an interprime number because it is at equal distance from previous prime (117050737) and next prime (117050743).
It can be written as a sum of positive squares in 4 ways, for example, as 7806436 + 109244304 = 2794^2 + 10452^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117050743) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24667 + ... + 29026.
It is an arithmetic number, because the mean of its divisors is an integer number (10336095).
Almost surely, 2117050740 is an apocalyptic number.
117050740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
117050740 is an abundant number, since it is smaller than the sum of its proper divisors (131015540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117050740 is a wasteful number, since it uses less digits than its factorization.
117050740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53811 (or 53809 counting only the distinct ones).
The product of its (nonzero) digits is 980, while the sum is 25.
The square root of 117050740 is about 10818.9990294851. Note that the first 3 decimals coincide. The cubic root of 117050740 is about 489.1680175615.
The spelling of 117050740 in words is "one hundred seventeen million, fifty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •