Base | Representation |
---|---|
bin | 11001011101111110100101… |
… | …000011010001100001000000 |
3 | 112200121011112121002020000222 |
4 | 121131332211003101201000 |
5 | 104140142440112224300 |
6 | 1034121124502202212 |
7 | 32410354323660233 |
oct | 3135764503214100 |
9 | 480534477066028 |
10 | 112011221211200 |
11 | 3276576827a043 |
12 | 10690637423368 |
13 | 4a667c7532c6c |
14 | 1d9352cc0541a |
15 | ce3a078c8785 |
hex | 65dfa50d1840 |
112011221211200 has 84 divisors (see below), whose sum is σ = 275633502590160. Its totient is φ = 44801905175040.
The previous prime is 112011221211199. The next prime is 112011221211209. The reversal of 112011221211200 is 2112122110211.
112011221211200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (112011221211209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25860899 + ... + 29879901.
Almost surely, 2112011221211200 is an apocalyptic number.
112011221211200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112011221211200 is an abundant number, since it is smaller than the sum of its proper divisors (163622281378960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112011221211200 is a wasteful number, since it uses less digits than its factorization.
112011221211200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4036444 (or 4036429 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 112011221211200 its reverse (2112122110211), we get a palindrome (114123343321411).
The spelling of 112011221211200 in words is "one hundred twelve trillion, eleven billion, two hundred twenty-one million, two hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •