Base | Representation |
---|---|
bin | 111101100011… |
… | …0000110000000 |
3 | 2020201102022000 |
4 | 1323012012000 |
5 | 31230044142 |
6 | 3111344000 |
7 | 541164522 |
oct | 173060600 |
9 | 66642260 |
10 | 32268672 |
11 | 1723aa27 |
12 | a982000 |
13 | 68ba7b7 |
14 | 43dda12 |
15 | 2c7614c |
hex | 1ec6180 |
32268672 has 64 divisors (see below), whose sum is σ = 95247600. Its totient is φ = 10755072.
The previous prime is 32268671. The next prime is 32268689. The reversal of 32268672 is 27686223.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nialpdrome in base 12.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32268671) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1213 + ... + 8124.
Almost surely, 232268672 is an apocalyptic number.
32268672 is a gapful number since it is divisible by the number (32) 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 32268672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47623800).
32268672 is an abundant number, since it is smaller than the sum of its proper divisors (62978928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32268672 is an equidigital number, since it uses as much as digits as its factorization.
32268672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9360 (or 9342 counting only the distinct ones).
The product of its digits is 48384, while the sum is 36.
The square root of 32268672 is about 5680.5520858452. The cubic root of 32268672 is about 318.3662565353.
The spelling of 32268672 in words is "thirty-two million, two hundred sixty-eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •