Base | Representation |
---|---|
bin | 10011110010110111… |
… | …001100011000100100 |
3 | 2000212020221121121121 |
4 | 103302313030120210 |
5 | 322012113032400 |
6 | 13433020023324 |
7 | 1351463424010 |
oct | 236267143044 |
9 | 60766847547 |
10 | 21254424100 |
11 | 9017628458 |
12 | 4152091b44 |
13 | 2009546110 |
14 | 1058b41540 |
15 | 845e5721a |
hex | 4f2dcc624 |
21254424100 has 144 divisors (see below), whose sum is σ = 59753814400. Its totient is φ = 6372587520.
The previous prime is 21254424089. The next prime is 21254424127. The reversal of 21254424100 is 142445212.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 111436 + ... + 234364.
Almost surely, 221254424100 is an apocalyptic number.
21254424100 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 21254424100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29876907200).
21254424100 is an abundant number, since it is smaller than the sum of its proper divisors (38499390300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21254424100 is a wasteful number, since it uses less digits than its factorization.
21254424100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122982 (or 122975 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 25.
Adding to 21254424100 its reverse (142445212), we get a palindrome (21396869312).
The spelling of 21254424100 in words is "twenty-one billion, two hundred fifty-four million, four hundred twenty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •