Base | Representation |
---|---|
bin | 111111000010… |
… | …1011111111100 |
3 | 2022012020201220 |
4 | 1332011133330 |
5 | 31430141133 |
6 | 3140233340 |
7 | 550641315 |
oct | 176053774 |
9 | 68166656 |
10 | 33052668 |
11 | 17725a60 |
12 | b09b850 |
13 | 6b035bc |
14 | 456560c |
15 | 2d7d5b3 |
hex | 1f857fc |
33052668 has 48 divisors (see below), whose sum is σ = 84564480. Its totient is φ = 9964800.
The previous prime is 33052661. The next prime is 33052697. The reversal of 33052668 is 86625033.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33052661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31293 + ... + 32331.
It is an arithmetic number, because the mean of its divisors is an integer number (1761760).
Almost surely, 233052668 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 33052668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42282240).
33052668 is an abundant number, since it is smaller than the sum of its proper divisors (51511812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33052668 is a wasteful number, since it uses less digits than its factorization.
33052668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1298 (or 1296 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 33.
The square root of 33052668 is about 5749.1449799079. The cubic root of 33052668 is about 320.9239831254.
The spelling of 33052668 in words is "thirty-three million, fifty-two thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •