Base | Representation |
---|---|
bin | 110011110010000011… |
… | …0111111101000000000 |
3 | 101122000210201022222012 |
4 | 1213210012333220000 |
5 | 3310220003033440 |
6 | 123030220032052 |
7 | 11014445532563 |
oct | 1474406775000 |
9 | 348023638865 |
10 | 111201221120 |
11 | 43184210340 |
12 | 19675092628 |
13 | a64232b132 |
14 | 554c9504da |
15 | 2d5c7c4e65 |
hex | 19e41bfa00 |
111201221120 has 80 divisors (see below), whose sum is σ = 290860767648. Its totient is φ = 40436797440.
The previous prime is 111201221119. The next prime is 111201221129. The reversal of 111201221120 is 21122102111.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 111201221095 and 111201221104.
It is not an unprimeable number, because it can be changed into a prime (111201221129) 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 7 ways as a sum of consecutive naturals, for example, 1946294 + ... + 2002613.
Almost surely, 2111201221120 is an apocalyptic number.
111201221120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111201221120 is an abundant number, since it is smaller than the sum of its proper divisors (179659546528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111201221120 is an equidigital number, since it uses as much as digits as its factorization.
111201221120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3948941 (or 3948925 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111201221120 its reverse (21122102111), we get a palindrome (132323323231).
The spelling of 111201221120 in words is "one hundred eleven billion, two hundred one million, two hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •