Base | Representation |
---|---|
bin | 111111000111… |
… | …1101000001000 |
3 | 2022021100122100 |
4 | 1332033220020 |
5 | 31433003102 |
6 | 3141153400 |
7 | 551203260 |
oct | 176175010 |
9 | 68240570 |
10 | 33094152 |
11 | 17754143 |
12 | b0bb860 |
13 | 6b19450 |
14 | 45767a0 |
15 | 2d8aa1c |
hex | 1f8fa08 |
33094152 has 96 divisors (see below), whose sum is σ = 110335680. Its totient is φ = 8726400.
The previous prime is 33094141. The next prime is 33094153. The reversal of 33094152 is 25149033.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (33094153) 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, 4027 + ... + 9077.
It is an arithmetic number, because the mean of its divisors is an integer number (1149330).
Almost surely, 233094152 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 33094152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55167840).
33094152 is an abundant number, since it is smaller than the sum of its proper divisors (77241528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33094152 is a wasteful number, since it uses less digits than its factorization.
33094152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5083 (or 5076 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 33094152 is about 5752.7516894092. The cubic root of 33094152 is about 321.0581895849.
The spelling of 33094152 in words is "thirty-three million, ninety-four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •