Base | Representation |
---|---|
bin | 10010101110101101… |
… | …110101110000011000 |
3 | 1220220120121211012100 |
4 | 102232231311300120 |
5 | 312141421341212 |
6 | 13123335043400 |
7 | 1311241466043 |
oct | 225655656030 |
9 | 56816554170 |
10 | 20111121432 |
11 | 8590227216 |
12 | 3a93210560 |
13 | 1b8671356c |
14 | d8ad6dc5a |
15 | 7ca8babdc |
hex | 4aeb75c18 |
20111121432 has 96 divisors (see below), whose sum is σ = 56992366080. Its totient is φ = 6394576320.
The previous prime is 20111121427. The next prime is 20111121469. The reversal of 20111121432 is 23412111102.
20111121432 is a `hidden beast` number, since 2 + 0 + 111 + 121 + 432 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 591207 + ... + 624297.
It is an arithmetic number, because the mean of its divisors is an integer number (593670480).
Almost surely, 220111121432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20111121432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28496183040).
20111121432 is an abundant number, since it is smaller than the sum of its proper divisors (36881244648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111121432 is a wasteful number, since it uses less digits than its factorization.
20111121432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33493 (or 33486 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 20111121432 its reverse (23412111102), we get a palindrome (43523232534).
The spelling of 20111121432 in words is "twenty billion, one hundred eleven million, one hundred twenty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •