Base | Representation |
---|---|
bin | 1001100110011010100000… |
… | …10101011010011110000000 |
3 | 2202202012110200210221002122 |
4 | 10303031100111122132000 |
5 | 10231341024141104220 |
6 | 112522151101303412 |
7 | 4306141015434200 |
oct | 463152025323600 |
9 | 82665420727078 |
10 | 21111112050560 |
11 | 67aa199429094 |
12 | 244b584864b68 |
13 | ba1a0028914c |
14 | 52dad7442400 |
15 | 26923615b425 |
hex | 13335055a780 |
21111112050560 has 96 divisors (see below), whose sum is σ = 58708548618120. Its totient is φ = 7238095549440.
The previous prime is 21111112050559. The next prime is 21111112050571. The reversal of 21111112050560 is 6505021111112.
It is a happy number.
It is a super-2 number, since 2×211111120505602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 336561626 + ... + 336624345.
Almost surely, 221111112050560 is an apocalyptic number.
21111112050560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21111112050560 is an abundant number, since it is smaller than the sum of its proper divisors (37597436567560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21111112050560 is an equidigital number, since it uses as much as digits as its factorization.
21111112050560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673186004 (or 673185985 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 26.
Adding to 21111112050560 its reverse (6505021111112), we get a palindrome (27616133161672).
The spelling of 21111112050560 in words is "twenty-one trillion, one hundred eleven billion, one hundred twelve million, fifty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •