Base | Representation |
---|---|
bin | 1101010110110… |
… | …01111011100100 |
3 | 21210211022022121 |
4 | 12223121323210 |
5 | 212140313300 |
6 | 15041235324 |
7 | 2530224121 |
oct | 653317344 |
9 | 253738277 |
10 | 112041700 |
11 | 58276651 |
12 | 31632b44 |
13 | 1a29b784 |
14 | 10c47748 |
15 | 9c8281a |
hex | 6ad9ee4 |
112041700 has 36 divisors (see below), whose sum is σ = 246078000. Its totient is φ = 44273440.
The previous prime is 112041697. The next prime is 112041701. The reversal of 112041700 is 7140211.
It is not an unprimeable number, because it can be changed into a prime (112041701) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1551 + ... + 15049.
It is an arithmetic number, because the mean of its divisors is an integer number (6835500).
Almost surely, 2112041700 is an apocalyptic number.
112041700 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 112041700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123039000).
112041700 is an abundant number, since it is smaller than the sum of its proper divisors (134036300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112041700 is a wasteful number, since it uses less digits than its factorization.
112041700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13596 (or 13589 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 16.
The square root of 112041700 is about 10584.9752007267. The cubic root of 112041700 is about 482.0882685862.
Adding to 112041700 its reverse (7140211), we get a palindrome (119181911).
The spelling of 112041700 in words is "one hundred twelve million, forty-one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •