Base | Representation |
---|---|
bin | 10011100101000100… |
… | …011001000110001110 |
3 | 2000021010111012120120 |
4 | 103211010121012032 |
5 | 321023342044042 |
6 | 13354031525410 |
7 | 1342653402000 |
oct | 234504310616 |
9 | 60233435516 |
10 | 21023003022 |
11 | 8a08a3436a |
12 | 40a8689866 |
13 | 1ca060a078 |
14 | 1036100370 |
15 | 830992dec |
hex | 4e511918e |
21023003022 has 64 divisors (see below), whose sum is σ = 49113984000. Its totient is φ = 5996682720.
The previous prime is 21023002999. The next prime is 21023003033. The reversal of 21023003022 is 22030032012.
It is a super-2 number, since 2×210230030222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21023002992 and 21023003010.
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, 1290504 + ... + 1306692.
It is an arithmetic number, because the mean of its divisors is an integer number (767406000).
Almost surely, 221023003022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21023003022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24556992000).
21023003022 is an abundant number, since it is smaller than the sum of its proper divisors (28090980978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21023003022 is a wasteful number, since it uses less digits than its factorization.
21023003022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16846 (or 16832 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 21023003022 its reverse (22030032012), we get a palindrome (43053035034).
The spelling of 21023003022 in words is "twenty-one billion, twenty-three million, three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •