Base | Representation |
---|---|
bin | 10011110111011100… |
… | …111000010101001100 |
3 | 2001001121211000120102 |
4 | 103313130320111030 |
5 | 322141320143200 |
6 | 13444410110232 |
7 | 1353420004262 |
oct | 236734702514 |
9 | 61047730512 |
10 | 21331412300 |
11 | 9057031870 |
12 | 4173a1b378 |
13 | 201c490673 |
14 | 1065062432 |
15 | 84cab36d5 |
hex | 4f773854c |
21331412300 has 72 divisors (see below), whose sum is σ = 50535432192. Its totient is φ = 7751016000.
The previous prime is 21331412293. The next prime is 21331412327. The reversal of 21331412300 is 321413312.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1611509 + ... + 1624691.
Almost surely, 221331412300 is an apocalyptic number.
21331412300 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 21331412300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25267716096).
21331412300 is an abundant number, since it is smaller than the sum of its proper divisors (29204019892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21331412300 is a wasteful number, since it uses less digits than its factorization.
21331412300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14679 (or 14672 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 21331412300 its reverse (321413312), we get a palindrome (21652825612).
The spelling of 21331412300 in words is "twenty-one billion, three hundred thirty-one million, four hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •