Base | Representation |
---|---|
bin | 10011110000010101… |
… | …011100100011111000 |
3 | 2000202022011102021200 |
4 | 103300111130203320 |
5 | 321420234214112 |
6 | 13424503134200 |
7 | 1350440135514 |
oct | 236025344370 |
9 | 60668142250 |
10 | 21212023032 |
11 | 8aa56a7952 |
12 | 413ba44360 |
13 | 200081b725 |
14 | 1053265144 |
15 | 84237dcdc |
hex | 4f055c8f8 |
21212023032 has 48 divisors (see below), whose sum is σ = 57455976240. Its totient is φ = 7069843968.
The previous prime is 21212023009. The next prime is 21212023043. The reversal of 21212023032 is 23032021212.
It is a super-2 number, since 2×212120230322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21212022996 and 21212023014.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1080133 + ... + 1099595.
It is an arithmetic number, because the mean of its divisors is an integer number (1196999505).
Almost surely, 221212023032 is an apocalyptic number.
It is an amenable number.
21212023032 is an abundant number, since it is smaller than the sum of its proper divisors (36243953208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21212023032 is a wasteful number, since it uses less digits than its factorization.
21212023032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34612 (or 34605 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 21212023032 its reverse (23032021212), we get a palindrome (44244044244).
The spelling of 21212023032 in words is "twenty-one billion, two hundred twelve million, twenty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •