| Base | Representation |
|---|---|
| bin | 11001010010001100000111… |
| … | …010000110001111010100000 |
| 3 | 112120201201112020220212102201 |
| 4 | 121102030013100301322200 |
| 5 | 104033404343221200000 |
| 6 | 1032301031144022544 |
| 7 | 32265005264102350 |
| oct | 3122140720617240 |
| 9 | 476651466825381 |
| 10 | 111201120100000 |
| 11 | 3248314831aa67 |
| 12 | 1057b632161a54 |
| 13 | 4a082b3956918 |
| 14 | 1d6623d11ab60 |
| 15 | ccc8e290496a |
| hex | 652307431ea0 |
111201120100000 has 288 divisors, whose sum is σ = 315957379933440. Its totient is φ = 37733022720000.
The previous prime is 111201120099997. The next prime is 111201120100013. The reversal of 111201120100000 is 1021102111.
It is a super-2 number, since 2×1112011201000002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a self number, because there is not a number n which added to its sum of digits gives 111201120100000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 67081141 + ... + 68718859.
It is an arithmetic number, because the mean of its divisors is an integer number (1097074235880).
Almost surely, 2111201120100000 is an apocalyptic number.
111201120100000 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 111201120100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157978689966720).
111201120100000 is an abundant number, since it is smaller than the sum of its proper divisors (204756259833440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111201120100000 is an frugal number, since it uses more digits than its factorization.
111201120100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1637858 (or 1637830 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 111201120100000 its reverse (1021102111), we get a palindrome (111202141202111).
The spelling of 111201120100000 in words is "one hundred eleven trillion, two hundred one billion, one hundred twenty million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •