Base | Representation |
---|---|
bin | 10011100100010111… |
… | …011010011101000100 |
3 | 2000020022022011110202 |
4 | 103210113122131010 |
5 | 321012332241400 |
6 | 13352531110032 |
7 | 1342451233064 |
oct | 234427323504 |
9 | 60208264422 |
10 | 21011212100 |
11 | 8a023106aa |
12 | 40a4742318 |
13 | 1c9b03c2a8 |
14 | 10347113a4 |
15 | 82e9144d5 |
hex | 4e45da744 |
21011212100 has 72 divisors (see below), whose sum is σ = 46650722496. Its totient is φ = 8211600000.
The previous prime is 21011212093. The next prime is 21011212121. The reversal of 21011212100 is 121211012.
It is a super-2 number, since 2×210112121002 (a number of 21 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 909695 + ... + 932505.
Almost surely, 221011212100 is an apocalyptic number.
21011212100 is a gapful number since it is divisible by the number (20) 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 21011212100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23325361248).
21011212100 is an abundant number, since it is smaller than the sum of its proper divisors (25639510396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21011212100 is a wasteful number, since it uses less digits than its factorization.
21011212100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23037 (or 23030 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21011212100 its reverse (121211012), we get a palindrome (21132423112).
The spelling of 21011212100 in words is "twenty-one billion, eleven million, two hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •