Base | Representation |
---|---|
bin | 101110100010… |
… | …0000101010000 |
3 | 1200220110011201 |
4 | 1131010011100 |
5 | 22221133422 |
6 | 2230520544 |
7 | 414235456 |
oct | 135040520 |
9 | 50813151 |
10 | 24396112 |
11 | 12853184 |
12 | 8206154 |
13 | 5092390 |
14 | 33509d6 |
15 | 221d727 |
hex | 1744150 |
24396112 has 40 divisors (see below), whose sum is σ = 51887304. Its totient is φ = 11042304.
The previous prime is 24396103. The next prime is 24396121. The reversal of 24396112 is 21169342.
It is an interprime number because it is at equal distance from previous prime (24396103) and next prime (24396121).
It can be written as a sum of positive squares in 4 ways, for example, as 9217296 + 15178816 = 3036^2 + 3896^2 .
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9918 + ... + 12130.
Almost surely, 224396112 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 24396112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25943652).
24396112 is an abundant number, since it is smaller than the sum of its proper divisors (27491192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24396112 is a wasteful number, since it uses less digits than its factorization.
24396112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2287 (or 2281 counting only the distinct ones).
The product of its digits is 2592, while the sum is 28.
The square root of 24396112 is about 4939.2420471161. The cubic root of 24396112 is about 290.0281859247.
The spelling of 24396112 in words is "twenty-four million, three hundred ninety-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •