Base | Representation |
---|---|
bin | 11010010111000… |
… | …00011011010100 |
3 | 120102002001220111 |
4 | 31023200123110 |
5 | 423101321322 |
6 | 33535212404 |
7 | 5323330225 |
oct | 1513403324 |
9 | 512061814 |
10 | 221120212 |
11 | 1038a8985 |
12 | 62077104 |
13 | 36a70581 |
14 | 2151d24c |
15 | 1462c177 |
hex | d2e06d4 |
221120212 has 24 divisors (see below), whose sum is σ = 393230376. Its totient is φ = 108776448.
The previous prime is 221120197. The next prime is 221120219. The reversal of 221120212 is 212021122.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 63266116 + 157854096 = 7954^2 + 12564^2 .
It is a junction number, because it is equal to n+sod(n) for n = 221120192 and 221120201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221120219) 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 7 ways as a sum of consecutive naturals, for example, 172518 + ... + 173794.
It is an arithmetic number, because the mean of its divisors is an integer number (16384599).
Almost surely, 2221120212 is an apocalyptic number.
It is an amenable number.
221120212 is a deficient number, since it is larger than the sum of its proper divisors (172110164).
221120212 is a wasteful number, since it uses less digits than its factorization.
221120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1947 (or 1945 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 221120212 is about 14870.1113647477. Note that the first 3 decimals coincide. The cubic root of 221120212 is about 604.7039618987.
Adding to 221120212 its reverse (212021122), we get a palindrome (433141334).
The spelling of 221120212 in words is "two hundred twenty-one million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •