Base | Representation |
---|---|
bin | 1101010110101… |
… | …11000101100000 |
3 | 21210210201100001 |
4 | 12223113011200 |
5 | 212134430143 |
6 | 15041105344 |
7 | 2530145134 |
oct | 653270540 |
9 | 253721301 |
10 | 112030048 |
11 | 58268919 |
12 | 31628254 |
13 | 1a296390 |
14 | 10c433c4 |
15 | 9c7e14d |
hex | 6ad7160 |
112030048 has 48 divisors (see below), whose sum is σ = 240934176. Its totient is φ = 50964480.
The previous prime is 112030027. The next prime is 112030049. The reversal of 112030048 is 840030211.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112030049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27640 + ... + 31432.
It is an arithmetic number, because the mean of its divisors is an integer number (5019462).
Almost surely, 2112030048 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112030048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120467088).
112030048 is an abundant number, since it is smaller than the sum of its proper divisors (128904128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112030048 is a wasteful number, since it uses less digits than its factorization.
112030048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3887 (or 3879 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 112030048 is about 10584.4247836148. The cubic root of 112030048 is about 482.0715560965.
Adding to 112030048 its reverse (840030211), we get a palindrome (952060259).
The spelling of 112030048 in words is "one hundred twelve million, thirty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •