Base | Representation |
---|---|
bin | 100101011100… |
… | …1000000000000 |
3 | 1100221102012212 |
4 | 1022321000000 |
5 | 20011212003 |
6 | 1540441252 |
7 | 325604345 |
oct | 112710000 |
9 | 40842185 |
10 | 19632128 |
11 | 100999aa |
12 | 66a9228 |
13 | 40b4b59 |
14 | 28707cc |
15 | 1acbdd8 |
hex | 12b9000 |
19632128 has 26 divisors (see below), whose sum is σ = 39267654. Its totient is φ = 9814016.
The previous prime is 19632103. The next prime is 19632169. The reversal of 19632128 is 82123691.
It can be written as a sum of positive squares in only one way, i.e., 18939904 + 692224 = 4352^2 + 832^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 19632094 and 19632103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1700 + ... + 6492.
Almost surely, 219632128 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 19632128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19633827).
19632128 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19632128 is an frugal number, since it uses more digits than its factorization.
19632128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4817 (or 4795 counting only the distinct ones).
The product of its digits is 5184, while the sum is 32.
The square root of 19632128 is about 4430.8157262518. The cubic root of 19632128 is about 269.7671884299.
The spelling of 19632128 in words is "nineteen million, six hundred thirty-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •