Base | Representation |
---|---|
bin | 111111011100… |
… | …101101100000 |
3 | 1011022000201220 |
4 | 333130231200 |
5 | 13224221142 |
6 | 1352255040 |
7 | 261242520 |
oct | 77345540 |
9 | 34260656 |
10 | 16632672 |
11 | 9430411 |
12 | 56a1480 |
13 | 35a4824 |
14 | 22cd680 |
15 | 16d82ec |
hex | fdcb60 |
16632672 has 96 divisors (see below), whose sum is σ = 50948352. Its totient is φ = 4652544.
The previous prime is 16632667. The next prime is 16632697. The reversal of 16632672 is 27623661.
It is a tau number, because it is divible by the number of its divisors (96).
It is a nude number because it is divisible by every one of its digits.
It is a nialpdrome in base 16.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35383 + ... + 35849.
It is an arithmetic number, because the mean of its divisors is an integer number (530712).
Almost surely, 216632672 is an apocalyptic number.
16632672 is a gapful number since it is divisible by the number (12) 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 16632672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25474176).
16632672 is an abundant number, since it is smaller than the sum of its proper divisors (34315680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16632672 is a wasteful number, since it uses less digits than its factorization.
16632672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 540 (or 532 counting only the distinct ones).
The product of its digits is 18144, while the sum is 33.
The square root of 16632672 is about 4078.3173000638. The cubic root of 16632672 is about 255.2626896956.
The spelling of 16632672 in words is "sixteen million, six hundred thirty-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •