Base | Representation |
---|---|
bin | 1110000010101… |
… | …11000001110100 |
3 | 22012122201002010 |
4 | 13001113001310 |
5 | 220124000410 |
6 | 15404444220 |
7 | 2630154300 |
oct | 701270164 |
9 | 265581063 |
10 | 117796980 |
11 | 60547684 |
12 | 33549670 |
13 | 1b535272 |
14 | 11904d00 |
15 | a51cc20 |
hex | 7057074 |
117796980 has 144 divisors (see below), whose sum is σ = 388402560. Its totient is φ = 26595072.
The previous prime is 117796969. The next prime is 117796999. The reversal of 117796980 is 89697711.
It is a happy number.
It is a super-2 number, since 2×1177969802 = 27752256994240800, 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 47 ways as a sum of consecutive naturals, for example, 302626 + ... + 303014.
It is an arithmetic number, because the mean of its divisors is an integer number (2697240).
Almost surely, 2117796980 is an apocalyptic number.
117796980 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 117796980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194201280).
117796980 is an abundant number, since it is smaller than the sum of its proper divisors (270605580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117796980 is a wasteful number, since it uses less digits than its factorization.
117796980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 518 (or 509 counting only the distinct ones).
The product of its (nonzero) digits is 190512, while the sum is 48.
The square root of 117796980 is about 10853.4317153608. The cubic root of 117796980 is about 490.2053561013.
The spelling of 117796980 in words is "one hundred seventeen million, seven hundred ninety-six thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •