Base | Representation |
---|---|
bin | 10011110000110000… |
… | …111011010010000000 |
3 | 2000202210201101221010 |
4 | 103300300323102000 |
5 | 321424110224002 |
6 | 13425321400520 |
7 | 1350555310563 |
oct | 236060732200 |
9 | 60683641833 |
10 | 21219226752 |
11 | 8aa9778139 |
12 | 4142339140 |
13 | 2002171599 |
14 | 10541bc4da |
15 | 842d0346c |
hex | 4f0c3b480 |
21219226752 has 128 divisors (see below), whose sum is σ = 59571590400. Its totient is φ = 6673536000.
The previous prime is 21219226751. The next prime is 21219226799. The reversal of 21219226752 is 25762291212.
It is a tau number, because it is divible by the number of its divisors (128).
It is a self number, because there is not a number n which added to its sum of digits gives 21219226752.
It is not an unprimeable number, because it can be changed into a prime (21219226751) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1825503 + ... + 1837089.
It is an arithmetic number, because the mean of its divisors is an integer number (465403050).
Almost surely, 221219226752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21219226752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29785795200).
21219226752 is an abundant number, since it is smaller than the sum of its proper divisors (38352363648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21219226752 is a wasteful number, since it uses less digits than its factorization.
21219226752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11874 (or 11862 counting only the distinct ones).
The product of its digits is 60480, while the sum is 39.
The spelling of 21219226752 in words is "twenty-one billion, two hundred nineteen million, two hundred twenty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •