Base | Representation |
---|---|
bin | 111110111000… |
… | …1011001100000 |
3 | 2022001001210120 |
4 | 1331301121200 |
5 | 31420022321 |
6 | 3134400240 |
7 | 550146300 |
oct | 175613140 |
9 | 68031716 |
10 | 32970336 |
11 | 1767a113 |
12 | b060080 |
13 | 6aa4c99 |
14 | 4543600 |
15 | 2d63ec6 |
hex | 1f71660 |
32970336 has 144 divisors (see below), whose sum is σ = 103650624. Its totient is φ = 9144576.
The previous prime is 32970331. The next prime is 32970389. The reversal of 32970336 is 63307923.
It is a junction number, because it is equal to n+sod(n) for n = 32970297 and 32970306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32970331) 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 23 ways as a sum of consecutive naturals, for example, 202191 + ... + 202353.
It is an arithmetic number, because the mean of its divisors is an integer number (719796).
Almost surely, 232970336 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 32970336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51825312).
32970336 is an abundant number, since it is smaller than the sum of its proper divisors (70680288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32970336 is a wasteful number, since it uses less digits than its factorization.
32970336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233 (or 218 counting only the distinct ones).
The product of its (nonzero) digits is 20412, while the sum is 33.
The square root of 32970336 is about 5741.9801462562. The cubic root of 32970336 is about 320.6572947950.
The spelling of 32970336 in words is "thirty-two million, nine hundred seventy thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •