Base | Representation |
---|---|
bin | 1101111101001… |
… | …11101111011000 |
3 | 22011022020012021 |
4 | 12332213233120 |
5 | 214433012000 |
6 | 15341224224 |
7 | 2621104123 |
oct | 676475730 |
9 | 264266167 |
10 | 117079000 |
11 | 600a7205 |
12 | 33262074 |
13 | 1b34351c |
14 | 117993ba |
15 | a42a11a |
hex | 6fa7bd8 |
117079000 has 128 divisors (see below), whose sum is σ = 297198720. Its totient is φ = 43008000.
The previous prime is 117078979. The next prime is 117079009. The reversal of 117079000 is 970711.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117079009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1206952 + ... + 1207048.
It is an arithmetic number, because the mean of its divisors is an integer number (2321865).
Almost surely, 2117079000 is an apocalyptic number.
117079000 is a gapful number since it is divisible by the number (10) 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 117079000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148599360).
117079000 is an abundant number, since it is smaller than the sum of its proper divisors (180119720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117079000 is a wasteful number, since it uses less digits than its factorization.
117079000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206 (or 192 counting only the distinct ones).
The product of its (nonzero) digits is 441, while the sum is 25.
The square root of 117079000 is about 10820.3049864595. The cubic root of 117079000 is about 489.2073816180.
The spelling of 117079000 in words is "one hundred seventeen million, seventy-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •