Base | Representation |
---|---|
bin | 110011101100101001… |
… | …1110001010110000000 |
3 | 101121120011202102022002 |
4 | 1213121103301112000 |
5 | 3304332111133440 |
6 | 123000224203132 |
7 | 11010115415651 |
oct | 1473123612600 |
9 | 347504672262 |
10 | 111020021120 |
11 | 430a09a9078 |
12 | 196244694a8 |
13 | a613926cb8 |
14 | 5532863528 |
15 | 2d4b931115 |
hex | 19d94f1580 |
111020021120 has 64 divisors (see below), whose sum is σ = 276946719840. Its totient is φ = 42477219840.
The previous prime is 111020021071. The next prime is 111020021153. The reversal of 111020021120 is 21120020111.
111020021120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
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, 3756341 + ... + 3785780.
Almost surely, 2111020021120 is an apocalyptic number.
111020021120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111020021120 is an abundant number, since it is smaller than the sum of its proper divisors (165926698720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111020021120 is an equidigital number, since it uses as much as digits as its factorization.
111020021120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7542163 (or 7542151 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 111020021120 its reverse (21120020111), we get a palindrome (132140041231).
The spelling of 111020021120 in words is "one hundred eleven billion, twenty million, twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •