Base | Representation |
---|---|
bin | 1101011011011… |
… | …10000000101111 |
3 | 21211222010100000 |
4 | 12231232000233 |
5 | 212314220424 |
6 | 15102235343 |
7 | 2535331344 |
oct | 655560057 |
9 | 254863300 |
10 | 112648239 |
11 | 58650320 |
12 | 31885b53 |
13 | 1a451882 |
14 | 10d647cb |
15 | 9d523c9 |
hex | 6b6e02f |
112648239 has 96 divisors (see below), whose sum is σ = 203164416. Its totient is φ = 61585920.
The previous prime is 112648223. The next prime is 112648247. The reversal of 112648239 is 932846211.
112648239 is a `hidden beast` number, since 1 + 1 + 2 + 648 + 2 + 3 + 9 = 666.
It is not a de Polignac number, because 112648239 - 24 = 112648223 is a prime.
It is a super-2 number, since 2×1126482392 = 25379251499602242, which contains 22 as substring.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112648219) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1681284 + ... + 1681350.
It is an arithmetic number, because the mean of its divisors is an integer number (2116296).
Almost surely, 2112648239 is an apocalyptic number.
112648239 is a deficient number, since it is larger than the sum of its proper divisors (90516177).
112648239 is a wasteful number, since it uses less digits than its factorization.
112648239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147 (or 135 counting only the distinct ones).
The product of its digits is 20736, while the sum is 36.
The square root of 112648239 is about 10613.5874707848. The cubic root of 112648239 is about 482.9566335818.
It can be divided in two parts, 11264 and 8239, that added together give a triangular number (19503 = T197).
The spelling of 112648239 in words is "one hundred twelve million, six hundred forty-eight thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •