Base | Representation |
---|---|
bin | 10011110010100110… |
… | …110100101000111101 |
3 | 2000211221212120200222 |
4 | 103302212310220331 |
5 | 322010013220131 |
6 | 13432344031125 |
7 | 1351412101121 |
oct | 236246645075 |
9 | 60757776628 |
10 | 21250132541 |
11 | 9015167110 |
12 | 41507624a5 |
13 | 20086a2931 |
14 | 1058345581 |
15 | 8458aa87b |
hex | 4f29b4a3d |
21250132541 has 8 divisors (see below), whose sum is σ = 23619358944. Its totient is φ = 18953805520.
The previous prime is 21250132531. The next prime is 21250132543. The reversal of 21250132541 is 14523105212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21250132541 - 222 = 21245938237 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21250132541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21250132543) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 18224231 + ... + 18225396.
It is an arithmetic number, because the mean of its divisors is an integer number (2952419868).
Almost surely, 221250132541 is an apocalyptic number.
It is an amenable number.
21250132541 is a deficient number, since it is larger than the sum of its proper divisors (2369226403).
21250132541 is a wasteful number, since it uses less digits than its factorization.
21250132541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36449691.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 21250132541 its reverse (14523105212), we get a palindrome (35773237753).
The spelling of 21250132541 in words is "twenty-one billion, two hundred fifty million, one hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •