Base | Representation |
---|---|
bin | 1100111011000011100… |
… | …1100110000011111101 |
3 | 210020001100021112012222 |
4 | 3032300321212003331 |
5 | 12114134333021341 |
6 | 245553542535125 |
7 | 22016434143500 |
oct | 3166071460375 |
9 | 706040245188 |
10 | 222011220221 |
11 | 8617760079a |
12 | 3703b1374a5 |
13 | 17c2159c23b |
14 | aa61543137 |
15 | 5b95a6c44b |
hex | 33b0e660fd |
222011220221 has 24 divisors (see below), whose sum is σ = 259114867704. Its totient is φ = 189664903680.
The previous prime is 222011220127. The next prime is 222011220229. The reversal of 222011220221 is 122022110222.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 10052268121 + 211958952100 = 100261^2 + 460390^2 .
It is not a de Polignac number, because 222011220221 - 218 = 222010958077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 222011220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222011220229) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21522161 + ... + 21532473.
It is an arithmetic number, because the mean of its divisors is an integer number (10796452821).
Almost surely, 2222011220221 is an apocalyptic number.
It is an amenable number.
222011220221 is a deficient number, since it is larger than the sum of its proper divisors (37103647483).
222011220221 is a wasteful number, since it uses less digits than its factorization.
222011220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11741 (or 11734 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 222011220221 its reverse (122022110222), we get a palindrome (344033330443).
The spelling of 222011220221 in words is "two hundred twenty-two billion, eleven million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •