Base | Representation |
---|---|
bin | 10011101010011100… |
… | …111000110011100000 |
3 | 2000111102102022001110 |
4 | 103222130320303200 |
5 | 321220001413212 |
6 | 13411015303320 |
7 | 1345131114624 |
oct | 235234706340 |
9 | 60442368043 |
10 | 21113310432 |
11 | 8a54a05695 |
12 | 411297ab40 |
13 | 1cb6238bc6 |
14 | 10440cb184 |
15 | 838880a3c |
hex | 4ea738ce0 |
21113310432 has 24 divisors (see below), whose sum is σ = 55422440136. Its totient is φ = 7037770112.
The previous prime is 21113310409. The next prime is 21113310433. The reversal of 21113310432 is 23401331112.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 21113310399 and 21113310408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113310433) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 109965063 + ... + 109965254.
It is an arithmetic number, because the mean of its divisors is an integer number (2309268339).
Almost surely, 221113310432 is an apocalyptic number.
It is an amenable number.
21113310432 is an abundant number, since it is smaller than the sum of its proper divisors (34309129704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21113310432 is a wasteful number, since it uses less digits than its factorization.
21113310432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219930330 (or 219930322 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 21113310432 its reverse (23401331112), we get a palindrome (44514641544).
The spelling of 21113310432 in words is "twenty-one billion, one hundred thirteen million, three hundred ten thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •