Base | Representation |
---|---|
bin | 1101011110101… |
… | …10101001001010 |
3 | 21212202220020000 |
4 | 12233112221022 |
5 | 212421424220 |
6 | 15115343430 |
7 | 2542065000 |
oct | 657265112 |
9 | 255686200 |
10 | 113076810 |
11 | 58913310 |
12 | 31a51b76 |
13 | 1a571972 |
14 | 11036a70 |
15 | 9dd9390 |
hex | 6bd6a4a |
113076810 has 320 divisors, whose sum is σ = 397267200. Its totient is φ = 22861440.
The previous prime is 113076767. The next prime is 113076839. The reversal of 113076810 is 18670311.
It is a super-2 number, since 2×1130768102 = 25572729919552200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 3056112 + ... + 3056148.
It is an arithmetic number, because the mean of its divisors is an integer number (1241460).
Almost surely, 2113076810 is an apocalyptic number.
113076810 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 113076810, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198633600).
113076810 is an abundant number, since it is smaller than the sum of its proper divisors (284190390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113076810 is a wasteful number, since it uses less digits than its factorization.
113076810 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88 (or 65 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 113076810 is about 10633.7580374955. The cubic root of 113076810 is about 483.5683291145.
The spelling of 113076810 in words is "one hundred thirteen million, seventy-six thousand, eight hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •