Base | Representation |
---|---|
bin | 110100010000011110… |
… | …1011010100001000000 |
3 | 101201122221201100221211 |
4 | 1220200331122201000 |
5 | 3314312330320000 |
6 | 123315405255504 |
7 | 11051653165264 |
oct | 1504075324100 |
9 | 351587640854 |
10 | 112222120000 |
11 | 43658508821 |
12 | 198bab64594 |
13 | a7759a4903 |
14 | 560837c0a4 |
15 | 2dbc2337ba |
hex | 1a20f5a840 |
112222120000 has 140 divisors (see below), whose sum is σ = 279491905836. Its totient is φ = 44692480000.
The previous prime is 112222119931. The next prime is 112222120013. The reversal of 112222120000 is 21222211.
It is a happy number.
It can be written as a sum of positive squares in 10 ways, for example, as 94332522496 + 17889597504 = 307136^2 + 133752^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9313980 + ... + 9326020.
Almost surely, 2112222120000 is an apocalyptic number.
112222120000 is a gapful number since it is divisible by the number (10) 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 112222120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139745952918).
112222120000 is an abundant number, since it is smaller than the sum of its proper divisors (167269785836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112222120000 is an equidigital number, since it uses as much as digits as its factorization.
112222120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12306 (or 12281 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 112222120000 its reverse (21222211), we get a palindrome (112243342211).
The spelling of 112222120000 in words is "one hundred twelve billion, two hundred twenty-two million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •