Base | Representation |
---|---|
bin | 10000001011101111000… |
… | …011010111110111110000 |
3 | 10221022120000022100012012 |
4 | 100023233003113313300 |
5 | 121210101210414300 |
6 | 2210521452022052 |
7 | 143230114511330 |
oct | 20135703276760 |
9 | 3838500270165 |
10 | 1112112201200 |
11 | 39970a388030 |
12 | 15b650161928 |
13 | 80b44266030 |
14 | 3bb7dd710c0 |
15 | 1dddded6435 |
hex | 102ef0d7df0 |
1112112201200 has 960 divisors, whose sum is σ = 3768490801152. Its totient is φ = 304006348800.
The previous prime is 1112112201199. The next prime is 1112112201229. The reversal of 1112112201200 is 21022112111.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1814212094 + ... + 1814212706.
Almost surely, 21112112201200 is an apocalyptic number.
1112112201200 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 1112112201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1884245400576).
1112112201200 is an abundant number, since it is smaller than the sum of its proper divisors (2656378599952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112112201200 is a wasteful number, since it uses less digits than its factorization.
1112112201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 882 (or 871 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1112112201200 its reverse (21022112111), we get a palindrome (1133134313311).
The spelling of 1112112201200 in words is "one trillion, one hundred twelve billion, one hundred twelve million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •