Base | Representation |
---|---|
bin | 10100000010010111… |
… | …001011010011110110 |
3 | 2001112101021010210110 |
4 | 110002113023103312 |
5 | 323030200412200 |
6 | 13514505403450 |
7 | 1361101643163 |
oct | 240227132366 |
9 | 61471233713 |
10 | 21514466550 |
11 | 91403a0175 |
12 | 4205199586 |
13 | 204b3937a5 |
14 | 10814b306a |
15 | 85dbc1b50 |
hex | 5025cb4f6 |
21514466550 has 96 divisors (see below), whose sum is σ = 55275033600. Its totient is φ = 5532163200.
The previous prime is 21514466527. The next prime is 21514466551. The reversal of 21514466550 is 5566441512.
It is a junction number, because it is equal to n+sod(n) for n = 21514466499 and 21514466508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21514466551) by changing a digit.
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, 1307776 + ... + 1324124.
It is an arithmetic number, because the mean of its divisors is an integer number (575781600).
Almost surely, 221514466550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21514466550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27637516800).
21514466550 is an abundant number, since it is smaller than the sum of its proper divisors (33760567050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21514466550 is a wasteful number, since it uses less digits than its factorization.
21514466550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16678 (or 16673 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 39.
The spelling of 21514466550 in words is "twenty-one billion, five hundred fourteen million, four hundred sixty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •