Base | Representation |
---|---|
bin | 111111000000… |
… | …0011101010110 |
3 | 2022011012102020 |
4 | 1332000131112 |
5 | 31424011042 |
6 | 3135554010 |
7 | 550524162 |
oct | 176003526 |
9 | 68135366 |
10 | 33032022 |
11 | 177114a1 |
12 | b08b906 |
13 | 6ac709a |
14 | 455bca2 |
15 | 2d773ec |
hex | 1f80756 |
33032022 has 8 divisors (see below), whose sum is σ = 66064056. Its totient is φ = 11010672.
The previous prime is 33032017. The next prime is 33032029. The reversal of 33032022 is 22023033.
It is a sphenic number, since it is the product of 3 distinct primes.
33032022 is an admirable number.
It is a super-2 number, since 2×330320222 = 2182228954816968, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33031992 and 33032010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33032029) 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 3 ways as a sum of consecutive naturals, for example, 2752663 + ... + 2752674.
It is an arithmetic number, because the mean of its divisors is an integer number (8258007).
Almost surely, 233032022 is an apocalyptic number.
33032022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33032022 is a wasteful number, since it uses less digits than its factorization.
33032022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5505342.
The product of its (nonzero) digits is 216, while the sum is 15.
The square root of 33032022 is about 5747.3491280764. The cubic root of 33032022 is about 320.8571486154.
Adding to 33032022 its reverse (22023033), we get a palindrome (55055055).
The spelling of 33032022 in words is "thirty-three million, thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •