Base | Representation |
---|---|
bin | 110100011100000000… |
… | …0101111011011000000 |
3 | 101202122220110012112000 |
4 | 1220320000233123000 |
5 | 3321110332234112 |
6 | 123422022504000 |
7 | 11064360404463 |
oct | 1507000573300 |
9 | 352586405460 |
10 | 112608868032 |
11 | 438368522a1 |
12 | 199a8595000 |
13 | a807b563bb |
14 | 56438932da |
15 | 2de117a7dc |
hex | 1a3802f6c0 |
112608868032 has 224 divisors, whose sum is σ = 348925286400. Its totient is φ = 35514547200.
The previous prime is 112608867961. The next prime is 112608868069. The reversal of 112608868032 is 230868806211.
112608868032 is a `hidden beast` number, since 1 + 1 + 2 + 608 + 8 + 6 + 8 + 0 + 32 = 666.
112608868032 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32534782 + ... + 32538242.
Almost surely, 2112608868032 is an apocalyptic number.
112608868032 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 112608868032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (174462643200).
112608868032 is an abundant number, since it is smaller than the sum of its proper divisors (236316418368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112608868032 is a wasteful number, since it uses less digits than its factorization.
112608868032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4492 (or 4476 counting only the distinct ones).
The product of its (nonzero) digits is 221184, while the sum is 45.
The spelling of 112608868032 in words is "one hundred twelve billion, six hundred eight million, eight hundred sixty-eight thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •