Base | Representation |
---|---|
bin | 10011110000010111… |
… | …000000010000111110 |
3 | 2000202022221011111020 |
4 | 103300113000100332 |
5 | 321420340301142 |
6 | 13424520005010 |
7 | 1350443456250 |
oct | 236027002076 |
9 | 60668834436 |
10 | 21212431422 |
11 | 8aa5956766 |
12 | 4140000766 |
13 | 2000932590 |
14 | 105332dcd0 |
15 | 84240ecec |
hex | 4f05c043e |
21212431422 has 64 divisors (see below), whose sum is σ = 52280847360. Its totient is φ = 5587455744.
The previous prime is 21212431399. The next prime is 21212431433. The reversal of 21212431422 is 22413421212.
21212431422 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 21212431392 and 21212431401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 417703 + ... + 465725.
It is an arithmetic number, because the mean of its divisors is an integer number (816888240).
Almost surely, 221212431422 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21212431422, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26140423680).
21212431422 is an abundant number, since it is smaller than the sum of its proper divisors (31068415938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21212431422 is a wasteful number, since it uses less digits than its factorization.
21212431422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48857.
The product of its digits is 1536, while the sum is 24.
Adding to 21212431422 its reverse (22413421212), we get a palindrome (43625852634).
The spelling of 21212431422 in words is "twenty-one billion, two hundred twelve million, four hundred thirty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •