Base | Representation |
---|---|
bin | 10011110101101010… |
… | …000110000101110100 |
3 | 2000222112012021120120 |
4 | 103311222012011310 |
5 | 322111114301400 |
6 | 13441413131540 |
7 | 1352603151612 |
oct | 236552060564 |
9 | 60875167516 |
10 | 21301322100 |
11 | 904104a633 |
12 | 4165929bb0 |
13 | 2016186606 |
14 | 106106c6b2 |
15 | 84a11cca0 |
hex | 4f5a86174 |
21301322100 has 36 divisors (see below), whose sum is σ = 61631826144. Its totient is φ = 5680352480.
The previous prime is 21301322089. The next prime is 21301322101. The reversal of 21301322100 is 122310312.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 21301322100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21301322101) 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, 35501904 + ... + 35502503.
Almost surely, 221301322100 is an apocalyptic number.
21301322100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21301322100 is an abundant number, since it is smaller than the sum of its proper divisors (40330504044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21301322100 is a wasteful number, since it uses less digits than its factorization.
21301322100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71004424 (or 71004417 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 21301322100 its reverse (122310312), we get a palindrome (21423632412).
The spelling of 21301322100 in words is "twenty-one billion, three hundred one million, three hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •