Base | Representation |
---|---|
bin | 111111010101… |
… | …1001010011100 |
3 | 2022111002100200 |
4 | 1332223022130 |
5 | 32000110230 |
6 | 3143423500 |
7 | 552153144 |
oct | 176531234 |
9 | 68432320 |
10 | 33206940 |
11 | 17820958 |
12 | b154b90 |
13 | 6b588a0 |
14 | 45a5924 |
15 | 2dae160 |
hex | 1fab29c |
33206940 has 144 divisors (see below), whose sum is σ = 113375808. Its totient is φ = 7805952.
The previous prime is 33206923. The next prime is 33206941. The reversal of 33206940 is 4960233.
It is a super-2 number, since 2×332069402 = 2205401728327200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33206941) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 53512 + ... + 54128.
It is an arithmetic number, because the mean of its divisors is an integer number (787332).
Almost surely, 233206940 is an apocalyptic number.
33206940 is a gapful number since it is divisible by the number (30) 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 33206940, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56687904).
33206940 is an abundant number, since it is smaller than the sum of its proper divisors (80168868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33206940 is a wasteful number, since it uses less digits than its factorization.
33206940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668 (or 663 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The square root of 33206940 is about 5762.5463121783. The cubic root of 33206940 is about 321.4225082454.
The spelling of 33206940 in words is "thirty-three million, two hundred six thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •