Base | Representation |
---|---|
bin | 110100001111111111… |
… | …0100101110011011000 |
3 | 101201121210201122221210 |
4 | 1220133332211303120 |
5 | 3314244121314120 |
6 | 123314020303120 |
7 | 11051363204211 |
oct | 1503776456330 |
9 | 351553648853 |
10 | 112205651160 |
11 | 4364a18a509 |
12 | 198b5541aa0 |
13 | a772459835 |
14 | 56060d2408 |
15 | 2dbaa7dce0 |
hex | 1a1ffa5cd8 |
112205651160 has 128 divisors (see below), whose sum is σ = 344256998400. Its totient is φ = 29244165120.
The previous prime is 112205651143. The next prime is 112205651203. The reversal of 112205651160 is 61156502211.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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, 4154500 + ... + 4181420.
It is an arithmetic number, because the mean of its divisors is an integer number (2689507800).
Almost surely, 2112205651160 is an apocalyptic number.
112205651160 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 112205651160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172128499200).
112205651160 is an abundant number, since it is smaller than the sum of its proper divisors (232051347240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112205651160 is a wasteful number, since it uses less digits than its factorization.
112205651160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27721 (or 27717 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 30.
The spelling of 112205651160 in words is "one hundred twelve billion, two hundred five million, six hundred fifty-one thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •