Base | Representation |
---|---|
bin | 1101010110101… |
… | …11110100011010 |
3 | 21210210212110020 |
4 | 12223113310122 |
5 | 212140024200 |
6 | 15041131310 |
7 | 2530156653 |
oct | 653276432 |
9 | 253725406 |
10 | 112033050 |
11 | 582700a8 |
12 | 31629b36 |
13 | 1a29785c |
14 | 10c4452a |
15 | 9c7eea0 |
hex | 6ad7d1a |
112033050 has 48 divisors (see below), whose sum is σ = 280077312. Its totient is φ = 29635200.
The previous prime is 112033049. The next prime is 112033067. The reversal of 112033050 is 50330211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16110 + ... + 21990.
It is an arithmetic number, because the mean of its divisors is an integer number (5834944).
Almost surely, 2112033050 is an apocalyptic number.
112033050 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 112033050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140038656).
112033050 is an abundant number, since it is smaller than the sum of its proper divisors (168044262).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112033050 is a wasteful number, since it uses less digits than its factorization.
112033050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6023 (or 6018 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 112033050 is about 10584.5665948115. The cubic root of 112033050 is about 482.0758619827.
Adding to 112033050 its reverse (50330211), we get a palindrome (162363261).
The spelling of 112033050 in words is "one hundred twelve million, thirty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •