Base | Representation |
---|---|
bin | 11010010101010… |
… | …01111011100000 |
3 | 120101122201201002 |
4 | 31022221323200 |
5 | 423022200432 |
6 | 33530331132 |
7 | 5321410361 |
oct | 1512517340 |
9 | 511581632 |
10 | 220896992 |
11 | 1037661a8 |
12 | 61b89aa8 |
13 | 369c2aa4 |
14 | 214a1b68 |
15 | 145d5e62 |
hex | d2a9ee0 |
220896992 has 48 divisors (see below), whose sum is σ = 447031872. Its totient is φ = 107397120.
The previous prime is 220896989. The next prime is 220897007. The reversal of 220896992 is 299698022.
220896992 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 289892 + ... + 290652.
It is an arithmetic number, because the mean of its divisors is an integer number (9313164).
Almost surely, 2220896992 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 220896992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223515936).
220896992 is an abundant number, since it is smaller than the sum of its proper divisors (226134880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220896992 is a wasteful number, since it uses less digits than its factorization.
220896992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1011 (or 1003 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 47.
The square root of 220896992 is about 14862.6038095618. The cubic root of 220896992 is about 604.5004112842.
The spelling of 220896992 in words is "two hundred twenty million, eight hundred ninety-six thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •