Base | Representation |
---|---|
bin | 10011110000010101… |
… | …101111100110001000 |
3 | 2000202022022101020101 |
4 | 103300111233212020 |
5 | 321420244213000 |
6 | 13424504535144 |
7 | 1350440612026 |
oct | 236025574610 |
9 | 60668271211 |
10 | 21212101000 |
11 | 8aa5750492 |
12 | 413ba814b4 |
13 | 200084806c |
14 | 1053285716 |
15 | 842396e6a |
hex | 4f056f988 |
21212101000 has 32 divisors (see below), whose sum is σ = 49636318680. Its totient is φ = 8484840000.
The previous prime is 21212100983. The next prime is 21212101039. The reversal of 21212101000 is 10121212.
It can be written as a sum of positive squares in 4 ways, for example, as 979314436 + 20232786564 = 31294^2 + 142242^2 .
It is a super-3 number, since 3×212121010003 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 7 ways as a sum of consecutive naturals, for example, 10605051 + ... + 10607050.
Almost surely, 221212101000 is an apocalyptic number.
21212101000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21212101000 is an abundant number, since it is smaller than the sum of its proper divisors (28424217680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21212101000 is a wasteful number, since it uses less digits than its factorization.
21212101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21212122 (or 21212108 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 21212101000 its reverse (10121212), we get a palindrome (21222222212).
The spelling of 21212101000 in words is "twenty-one billion, two hundred twelve million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.894 sec. • engine limits •