Base | Representation |
---|---|
bin | 10011100100010010… |
… | …110011000011000000 |
3 | 2000020020000200200101 |
4 | 103210102303003000 |
5 | 321012030031422 |
6 | 13352445132144 |
7 | 1342435033321 |
oct | 234422630300 |
9 | 60206020611 |
10 | 21010002112 |
11 | 8a01664610 |
12 | 40a425a054 |
13 | 1c9aa07618 |
14 | 10344b8448 |
15 | 82e775c27 |
hex | 4e44b30c0 |
21010002112 has 56 divisors (see below), whose sum is σ = 45670969872. Its totient is φ = 9510297600.
The previous prime is 21010002061. The next prime is 21010002113. The reversal of 21010002112 is 21120001012.
It is not an unprimeable number, because it can be changed into a prime (21010002113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107748 + ... + 231580.
Almost surely, 221010002112 is an apocalyptic number.
21010002112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21010002112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22835484936).
21010002112 is an abundant number, since it is smaller than the sum of its proper divisors (24660967760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21010002112 is a wasteful number, since it uses less digits than its factorization.
21010002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124097 (or 124087 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 21010002112 its reverse (21120001012), we get a palindrome (42130003124).
The spelling of 21010002112 in words is "twenty-one billion, ten million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •