Base | Representation |
---|---|
bin | 1101010110101… |
… | …00110011111100 |
3 | 21210210020120000 |
4 | 12223110303330 |
5 | 212134130412 |
6 | 15040554300 |
7 | 2530106025 |
oct | 653246374 |
9 | 253706500 |
10 | 112020732 |
11 | 5826191a |
12 | 31622990 |
13 | 1a292075 |
14 | 10c3dc4c |
15 | 9c7b4dc |
hex | 6ad4cfc |
112020732 has 120 divisors (see below), whose sum is σ = 318743040. Its totient is φ = 34175520.
The previous prime is 112020697. The next prime is 112020749. The reversal of 112020732 is 237020211.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 190543 + ... + 191129.
It is an arithmetic number, because the mean of its divisors is an integer number (2656192).
Almost surely, 2112020732 is an apocalyptic number.
112020732 is a gapful number since it is divisible by the number (12) 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 112020732, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159371520).
112020732 is an abundant number, since it is smaller than the sum of its proper divisors (206722308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112020732 is a wasteful number, since it uses less digits than its factorization.
112020732 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 653 (or 642 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 112020732 is about 10583.9846938665. The cubic root of 112020732 is about 482.0581933033.
Adding to 112020732 its reverse (237020211), we get a palindrome (349040943).
The spelling of 112020732 in words is "one hundred twelve million, twenty thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •