Base | Representation |
---|---|
bin | 111111000011… |
… | …0100011101000 |
3 | 2022012110200100 |
4 | 1332012203220 |
5 | 31430311000 |
6 | 3140305400 |
7 | 550660044 |
oct | 176064350 |
9 | 68173610 |
10 | 33057000 |
11 | 17729239 |
12 | b0a2260 |
13 | 6b05572 |
14 | 4567024 |
15 | 2d7ea00 |
hex | 1f868e8 |
33057000 has 96 divisors (see below), whose sum is σ = 111763080. Its totient is φ = 8812800.
The previous prime is 33056977. The next prime is 33057019. The reversal of 33057000 is 75033.
It can be written as a sum of positive squares in 4 ways, for example, as 3048516 + 30008484 = 1746^2 + 5478^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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, 7164 + ... + 10836.
Almost surely, 233057000 is an apocalyptic number.
33057000 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 33057000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55881540).
33057000 is an abundant number, since it is smaller than the sum of its proper divisors (78706080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33057000 is a wasteful number, since it uses less digits than its factorization.
33057000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3700 (or 3683 counting only the distinct ones).
The product of its (nonzero) digits is 315, while the sum is 18.
The square root of 33057000 is about 5749.5217192389. The cubic root of 33057000 is about 320.9380029918.
The spelling of 33057000 in words is "thirty-three million, fifty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •