Base | Representation |
---|---|
bin | 110011101111101010… |
… | …1000011010001110101 |
3 | 101121211012210200202010 |
4 | 1213133111003101311 |
5 | 3310033440120041 |
6 | 123014233034433 |
7 | 11012453041254 |
oct | 1473725032165 |
9 | 347735720663 |
10 | 111121020021 |
11 | 43142a12040 |
12 | 19652255a19 |
13 | a62b82a36b |
14 | 554203479b |
15 | 2d55731a16 |
hex | 19df543475 |
111121020021 has 64 divisors (see below), whose sum is σ = 168666624000. Its totient is φ = 64479667200.
The previous prime is 111121020011. The next prime is 111121020037. The reversal of 111121020021 is 120020121111.
It is not a de Polignac number, because 111121020021 - 225 = 111087465589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111121019979 and 111121020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111121020001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 83737860 + ... + 83739186.
It is an arithmetic number, because the mean of its divisors is an integer number (2635416000).
Almost surely, 2111121020021 is an apocalyptic number.
111121020021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111121020021 is a deficient number, since it is larger than the sum of its proper divisors (57545603979).
111121020021 is a wasteful number, since it uses less digits than its factorization.
111121020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2490.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 111121020021 its reverse (120020121111), we get a palindrome (231141141132).
The spelling of 111121020021 in words is "one hundred eleven billion, one hundred twenty-one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •