Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0100100000001010000 |
3 | 101201002121221022000112 |
4 | 1220103312210001100 |
5 | 3313340032020422 |
6 | 123241512140452 |
7 | 11043343106606 |
oct | 1502366440120 |
9 | 351077838015 |
10 | 112002220112 |
11 | 43555373782 |
12 | 19859397728 |
13 | a73c270933 |
14 | 55c7099876 |
15 | 2da7c97ee2 |
hex | 1a13da4050 |
112002220112 has 80 divisors (see below), whose sum is σ = 228098222208. Its totient is φ = 53175091200.
The previous prime is 112002220081. The next prime is 112002220157. The reversal of 112002220112 is 211022200211.
112002220112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1120022201123 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39985112 + ... + 39987912.
Almost surely, 2112002220112 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 112002220112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114049111104).
112002220112 is an abundant number, since it is smaller than the sum of its proper divisors (116096002096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112002220112 is a wasteful number, since it uses less digits than its factorization.
112002220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3588 (or 3582 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112002220112 its reverse (211022200211), we get a palindrome (323024420323).
The spelling of 112002220112 in words is "one hundred twelve billion, two million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •