Base | Representation |
---|---|
bin | 110011110010000011… |
… | …0001111000010101000 |
3 | 101122000210100012222211 |
4 | 1213210012033002220 |
5 | 3310214430201440 |
6 | 123030211454504 |
7 | 11014444043446 |
oct | 1474406170250 |
9 | 348023305884 |
10 | 111201022120 |
11 | 43184094881 |
12 | 19674bb7434 |
13 | a64228b696 |
14 | 554c8dbb96 |
15 | 2d5c785eea |
hex | 19e418f0a8 |
111201022120 has 32 divisors (see below), whose sum is σ = 250240933800. Its totient is φ = 44473540608.
The previous prime is 111201022111. The next prime is 111201022139. The reversal of 111201022120 is 21220102111.
111201022120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 91021683204 + 20179338916 = 301698^2 + 142054^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 111201022120.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51736 + ... + 474424.
Almost surely, 2111201022120 is an apocalyptic number.
111201022120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111201022120 is an abundant number, since it is smaller than the sum of its proper divisors (139039911680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111201022120 is a wasteful number, since it uses less digits than its factorization.
111201022120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 429277 (or 429273 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 111201022120 its reverse (21220102111), we get a palindrome (132421124231).
The spelling of 111201022120 in words is "one hundred eleven billion, two hundred one million, twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •