Base | Representation |
---|---|
bin | 10011101111101100… |
… | …101000011001010000 |
3 | 2000201120000211102102 |
4 | 103233230220121100 |
5 | 321410014323400 |
6 | 13423441535532 |
7 | 1350250164032 |
oct | 235754503120 |
9 | 60646024372 |
10 | 21201323600 |
11 | 8a9a65a246 |
12 | 41383445a8 |
13 | 1ccb5436c2 |
14 | 1051a7bc52 |
15 | 8414689d5 |
hex | 4efb28650 |
21201323600 has 60 divisors (see below), whose sum is σ = 51164808576. Its totient is φ = 8442464640.
The previous prime is 21201323587. The next prime is 21201323609. The reversal of 21201323600 is 632310212.
It is a happy number.
It is a super-2 number, since 2×212013236002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21201323609) 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, 29642 + ... + 208041.
Almost surely, 221201323600 is an apocalyptic number.
21201323600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21201323600 is an abundant number, since it is smaller than the sum of its proper divisors (29963484976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21201323600 is a wasteful number, since it uses less digits than its factorization.
21201323600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237924 (or 237913 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 21201323600 its reverse (632310212), we get a palindrome (21833633812).
The spelling of 21201323600 in words is "twenty-one billion, two hundred one million, three hundred twenty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •