Base | Representation |
---|---|
bin | 10011110000110011… |
… | …111000110100101000 |
3 | 2000202212011211220012 |
4 | 103300303320310220 |
5 | 321424310044422 |
6 | 13425350151052 |
7 | 1350565023200 |
oct | 236063706450 |
9 | 60685154805 |
10 | 21220003112 |
11 | 8aaa158460 |
12 | 4142652488 |
13 | 2002383a79 |
14 | 1054341400 |
15 | 842e084e2 |
hex | 4f0cf8d28 |
21220003112 has 48 divisors (see below), whose sum is σ = 50491019520. Its totient is φ = 8267532000.
The previous prime is 21220003033. The next prime is 21220003117. The reversal of 21220003112 is 21130002212.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (21220003117) 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 11 ways as a sum of consecutive naturals, for example, 2456264 + ... + 2464887.
It is an arithmetic number, because the mean of its divisors is an integer number (1051896240).
Almost surely, 221220003112 is an apocalyptic number.
21220003112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21220003112 is an abundant number, since it is smaller than the sum of its proper divisors (29271016408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21220003112 is a wasteful number, since it uses less digits than its factorization.
21220003112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4921182 (or 4921171 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 21220003112 its reverse (21130002212), we get a palindrome (42350005324).
The spelling of 21220003112 in words is "twenty-one billion, two hundred twenty million, three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •