Base | Representation |
---|---|
bin | 1000111000111000000000 |
3 | 11101101022110 |
4 | 20320320000 |
5 | 1044030422 |
6 | 121535320 |
7 | 25543221 |
oct | 10707000 |
9 | 4341273 |
10 | 2330112 |
11 | 1351714 |
12 | 944540 |
13 | 637785 |
14 | 449248 |
15 | 31060c |
hex | 238e00 |
2330112 has 80 divisors (see below), whose sum is σ = 6530832. Its totient is φ = 737280.
The previous prime is 2330101. The next prime is 2330117. The reversal of 2330112 is 2110332.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2330117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56812 + ... + 56852.
22330112 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 2330112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3265416).
2330112 is an abundant number, since it is smaller than the sum of its proper divisors (4200720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2330112 is an equidigital number, since it uses as much as digits as its factorization.
2330112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99 (or 83 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 2330112 is about 1526.4704386263. The cubic root of 2330112 is about 132.5741746784.
Adding to 2330112 its reverse (2110332), we get a palindrome (4440444).
It can be divided in two parts, 2330 and 112, that added together give a palindrome (2442).
The spelling of 2330112 in words is "two million, three hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •