Base | Representation |
---|---|
bin | 10011110101110010… |
… | …001100001010000100 |
3 | 2000222200012002102011 |
4 | 103311302030022010 |
5 | 322112140202400 |
6 | 13441530424004 |
7 | 1352630200321 |
oct | 236562141204 |
9 | 60880162364 |
10 | 21303444100 |
11 | 9042269954 |
12 | 4166592004 |
13 | 201674a433 |
14 | 1061461b48 |
15 | 84a3db8ba |
hex | 4f5c8c284 |
21303444100 has 144 divisors (see below), whose sum is σ = 50957988480. Its totient is φ = 7694438400.
The previous prime is 21303444091. The next prime is 21303444101. The reversal of 21303444100 is 144430312.
It is not an unprimeable number, because it can be changed into a prime (21303444101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15425410 + ... + 15426790.
It is an arithmetic number, because the mean of its divisors is an integer number (353874920).
Almost surely, 221303444100 is an apocalyptic number.
21303444100 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 21303444100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25478994240).
21303444100 is an abundant number, since it is smaller than the sum of its proper divisors (29654544380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21303444100 is a wasteful number, since it uses less digits than its factorization.
21303444100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1790 (or 1783 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 21303444100 its reverse (144430312), we get a palindrome (21447874412).
The spelling of 21303444100 in words is "twenty-one billion, three hundred three million, four hundred forty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •