Base | Representation |
---|---|
bin | 111101110110… |
… | …1000100010001 |
3 | 2021000112021100 |
4 | 1323231010101 |
5 | 31300201210 |
6 | 3115015013 |
7 | 542431110 |
oct | 173550421 |
9 | 67015240 |
10 | 32428305 |
11 | 17339958 |
12 | aa3a469 |
13 | 6945360 |
14 | 4441c77 |
15 | 2ca85c0 |
hex | 1eed111 |
32428305 has 48 divisors (see below), whose sum is σ = 69189120. Its totient is φ = 13682304.
The previous prime is 32428301. The next prime is 32428309. The reversal of 32428305 is 50382423.
It is an interprime number because it is at equal distance from previous prime (32428301) and next prime (32428309).
It is not a de Polignac number, because 32428305 - 22 = 32428301 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (32428301) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 136 + ... + 8054.
It is an arithmetic number, because the mean of its divisors is an integer number (1441440).
Almost surely, 232428305 is an apocalyptic number.
32428305 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
32428305 is an abundant number, since it is smaller than the sum of its proper divisors (36760815).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32428305 is a wasteful number, since it uses less digits than its factorization.
32428305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7950 (or 7947 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 32428305 is about 5694.5855863267. The cubic root of 32428305 is about 318.8903787673.
The spelling of 32428305 in words is "thirty-two million, four hundred twenty-eight thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •