Base | Representation |
---|---|
bin | 110100010000001101… |
… | …1000111111111000000 |
3 | 101201122022210200122022 |
4 | 1220200123013333000 |
5 | 3314303030144300 |
6 | 123314444501012 |
7 | 11051513610002 |
oct | 1504033077700 |
9 | 351568720568 |
10 | 112213131200 |
11 | 43653429365 |
12 | 198b7b4a768 |
13 | a773b783b1 |
14 | 56070bc372 |
15 | 2dbb55a285 |
hex | 1a206c7fc0 |
112213131200 has 42 divisors (see below), whose sum is σ = 276114439896. Its totient is φ = 44885251840.
The previous prime is 112213131137. The next prime is 112213131209. The reversal of 112213131200 is 2131312211.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112213131209) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 35065004 + ... + 35068203.
Almost surely, 2112213131200 is an apocalyptic number.
112213131200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112213131200 is an abundant number, since it is smaller than the sum of its proper divisors (163901308696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112213131200 is an equidigital number, since it uses as much as digits as its factorization.
112213131200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70133229 (or 70133214 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112213131200 its reverse (2131312211), we get a palindrome (114344443411).
It can be divided in two parts, 112 and 213131200, that added together give a palindrome (213131312).
The spelling of 112213131200 in words is "one hundred twelve billion, two hundred thirteen million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •