Base | Representation |
---|---|
bin | 11110111100001000… |
… | …001011100100011100 |
3 | 10011202020020021220202 |
4 | 132330020023210130 |
5 | 1021014041012340 |
6 | 23132254003032 |
7 | 2254151054225 |
oct | 367410134434 |
9 | 104666207822 |
10 | 33221032220 |
11 | 130a8452232 |
12 | 65317a6478 |
13 | 31957b8b1c |
14 | 187214a24c |
15 | ce67cdc15 |
hex | 7bc20b91c |
33221032220 has 36 divisors (see below), whose sum is σ = 73629234504. Its totient is φ = 12589020000.
The previous prime is 33221032217. The next prime is 33221032241. The reversal of 33221032220 is 2223012233.
It is a super-2 number, since 2×332210322202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 33221032192 and 33221032201.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 2293406 + ... + 2307845.
It is an arithmetic number, because the mean of its divisors is an integer number (2045256514).
Almost surely, 233221032220 is an apocalyptic number.
It is an amenable number.
33221032220 is an abundant number, since it is smaller than the sum of its proper divisors (40408202284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33221032220 is a wasteful number, since it uses less digits than its factorization.
33221032220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4601298 (or 4601277 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 33221032220 its reverse (2223012233), we get a palindrome (35444044453).
The spelling of 33221032220 in words is "thirty-three billion, two hundred twenty-one million, thirty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •