Base | Representation |
---|---|
bin | 11001100001000001000111… |
… | …110111000000001110111100 |
3 | 112201100010201111021121121020 |
4 | 121201001013313000032330 |
5 | 104202103241421023400 |
6 | 1034401112441504140 |
7 | 32431430652555606 |
oct | 3141010767001674 |
9 | 481303644247536 |
10 | 112220111111100 |
11 | 32836311171653 |
12 | 107050141a2050 |
13 | 4a80407563625 |
14 | 1d9d6a783c176 |
15 | ce918152c2a0 |
hex | 661047dc03bc |
112220111111100 has 108 divisors (see below), whose sum is σ = 339420934404216. Its totient is φ = 28624260184960.
The previous prime is 112220111111093. The next prime is 112220111111177. The reversal of 112220111111100 is 1111111022211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 112220111111100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 353401827 + ... + 353719226.
Almost surely, 2112220111111100 is an apocalyptic number.
112220111111100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112220111111100 is an abundant number, since it is smaller than the sum of its proper divisors (227200823293116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112220111111100 is a wasteful number, since it uses less digits than its factorization.
112220111111100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707121116 (or 707121086 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 112220111111100 its reverse (1111111022211), we get a palindrome (113331222133311).
The spelling of 112220111111100 in words is "one hundred twelve trillion, two hundred twenty billion, one hundred eleven million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •