Base | Representation |
---|---|
bin | 10011100110100100… |
… | …001010101001000000 |
3 | 2000022212201202101000 |
4 | 103212210022221000 |
5 | 321101304002012 |
6 | 13400330012000 |
7 | 1343406660054 |
oct | 234644125100 |
9 | 60285652330 |
10 | 21048109632 |
11 | 8a21122330 |
12 | 40b4b77000 |
13 | 1ca588a954 |
14 | 1039597c64 |
15 | 832ca1ddc |
hex | 4e690aa40 |
21048109632 has 448 divisors, whose sum is σ = 72881337600. Its totient is φ = 5884968960.
The previous prime is 21048109627. The next prime is 21048109661. The reversal of 21048109632 is 23690184012.
21048109632 is a `hidden beast` number, since 2 + 1 + 0 + 4 + 8 + 10 + 9 + 632 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17125594 + ... + 17126822.
Almost surely, 221048109632 is an apocalyptic number.
21048109632 is a gapful number since it is divisible by the number (22) 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 21048109632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36440668800).
21048109632 is an abundant number, since it is smaller than the sum of its proper divisors (51833227968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21048109632 is a wasteful number, since it uses less digits than its factorization.
21048109632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1331 (or 1315 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The spelling of 21048109632 in words is "twenty-one billion, forty-eight million, one hundred nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •