Base | Representation |
---|---|
bin | 101000111110… |
… | …1110110111000 |
3 | 1111102122200000 |
4 | 1101331312320 |
5 | 21000041112 |
6 | 2044313000 |
7 | 350431260 |
oct | 121756670 |
9 | 44378600 |
10 | 21487032 |
11 | 11146586 |
12 | 7242760 |
13 | 45b4228 |
14 | 2bd47a0 |
15 | 1d467dc |
hex | 147ddb8 |
21487032 has 96 divisors (see below), whose sum is σ = 69014400. Its totient is φ = 6135264.
The previous prime is 21487009. The next prime is 21487051. The reversal of 21487032 is 23078412.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 21486987 and 21487005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12819 + ... + 14397.
It is an arithmetic number, because the mean of its divisors is an integer number (718900).
Almost surely, 221487032 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 21487032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34507200).
21487032 is an abundant number, since it is smaller than the sum of its proper divisors (47527368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21487032 is a wasteful number, since it uses less digits than its factorization.
21487032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1607 (or 1591 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 21487032 is about 4635.4106614193. The cubic root of 21487032 is about 278.0089709508.
It can be divided in two parts, 2148 and 7032, that added together give a triangular number (9180 = T135).
The spelling of 21487032 in words is "twenty-one million, four hundred eighty-seven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.279 sec. • engine limits •