Base | Representation |
---|---|
bin | 10011101111101100… |
… | …101010010000000000 |
3 | 2000201120001012211220 |
4 | 103233230222100000 |
5 | 321410020044300 |
6 | 13423442035040 |
7 | 1350250225140 |
oct | 235754522000 |
9 | 60646035756 |
10 | 21201331200 |
11 | 8a9a664a25 |
12 | 4138348a80 |
13 | 1ccb546cba |
14 | 1051a80920 |
15 | 84146ada0 |
hex | 4efb2a400 |
21201331200 has 528 divisors, whose sum is σ = 81021897600. Its totient is φ = 4789370880.
The previous prime is 21201331141. The next prime is 21201331211. The reversal of 21201331200 is 213310212.
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 21201331200.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 60748626 + ... + 60748974.
Almost surely, 221201331200 is an apocalyptic number.
21201331200 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 21201331200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40510948800).
21201331200 is an abundant number, since it is smaller than the sum of its proper divisors (59820566400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21201331200 is a wasteful number, since it uses less digits than its factorization.
21201331200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502 (or 479 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 21201331200 its reverse (213310212), we get a palindrome (21414641412).
The spelling of 21201331200 in words is "twenty-one billion, two hundred one million, three hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •