Base | Representation |
---|---|
bin | 11001011111100110110100… |
… | …111001000100001010000000 |
3 | 112200222212110112100202120001 |
4 | 121133212310321010022000 |
5 | 104144011210431321232 |
6 | 1034244400011525344 |
7 | 32421426222002620 |
oct | 3137466471041200 |
9 | 480885415322501 |
10 | 112123156120192 |
11 | 327a9188648998 |
12 | 106aa276159854 |
13 | 4a74225866c19 |
14 | 1d98b0ad7c880 |
15 | ce68a97c76e7 |
hex | 65f9b4e44280 |
112123156120192 has 1024 divisors, whose sum is σ = 296921891635200. Its totient is φ = 41021973725184.
The previous prime is 112123156120181. The next prime is 112123156120331. The reversal of 112123156120192 is 291021651321211.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 305512686793 + ... + 305512687159.
It is an arithmetic number, because the mean of its divisors is an integer number (289962784800).
Almost surely, 2112123156120192 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 112123156120192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148460945817600).
112123156120192 is an abundant number, since it is smaller than the sum of its proper divisors (184798735515008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112123156120192 is a wasteful number, since it uses less digits than its factorization.
112123156120192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841 (or 829 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 37.
The spelling of 112123156120192 in words is "one hundred twelve trillion, one hundred twenty-three billion, one hundred fifty-six million, one hundred twenty thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •