Base | Representation |
---|---|
bin | 10011101011100001… |
… | …001110010101101110 |
3 | 2000112200010102102212 |
4 | 103223201032111232 |
5 | 321234043140210 |
6 | 13412455250422 |
7 | 1345436305211 |
oct | 235341162556 |
9 | 60480112385 |
10 | 21131224430 |
11 | 8a64030748 |
12 | 4118979a12 |
13 | 1cb9b6b9c4 |
14 | 1046631778 |
15 | 83a21d805 |
hex | 4eb84e56e |
21131224430 has 8 divisors (see below), whose sum is σ = 38036203992. Its totient is φ = 8452489768.
The previous prime is 21131224423. The next prime is 21131224441. The reversal of 21131224430 is 3442213112.
21131224430 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×211312244302 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21131224396 and 21131224405.
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 3 ways as a sum of consecutive naturals, for example, 1056561212 + ... + 1056561231.
It is an arithmetic number, because the mean of its divisors is an integer number (4754525499).
Almost surely, 221131224430 is an apocalyptic number.
21131224430 is a deficient number, since it is larger than the sum of its proper divisors (16904979562).
21131224430 is a wasteful number, since it uses less digits than its factorization.
21131224430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2113122450.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 21131224430 its reverse (3442213112), we get a palindrome (24573437542).
The spelling of 21131224430 in words is "twenty-one billion, one hundred thirty-one million, two hundred twenty-four thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •