Base | Representation |
---|---|
bin | 110100001010110000… |
… | …0111010111011010000 |
3 | 101201011120101210200102 |
4 | 1220111200322323100 |
5 | 3313414201214300 |
6 | 123244345511532 |
7 | 11044132101563 |
oct | 1502540727320 |
9 | 351146353612 |
10 | 112030101200 |
11 | 4356a0871a6 |
12 | 198667a25a8 |
13 | a744c83314 |
14 | 55caa764da |
15 | 2daa4540d5 |
hex | 1a1583aed0 |
112030101200 has 120 divisors (see below), whose sum is σ = 271350358656. Its totient is φ = 44447040000.
The previous prime is 112030101191. The next prime is 112030101277. The reversal of 112030101200 is 2101030211.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 61184285 + ... + 61186115.
Almost surely, 2112030101200 is an apocalyptic number.
112030101200 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 112030101200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135675179328).
112030101200 is an abundant number, since it is smaller than the sum of its proper divisors (159320257456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112030101200 is a wasteful number, since it uses less digits than its factorization.
112030101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3013 (or 3002 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 112030101200 its reverse (2101030211), we get a palindrome (114131131411).
The spelling of 112030101200 in words is "one hundred twelve billion, thirty million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •