Base | Representation |
---|---|
bin | 1100111011000011100… |
… | …1100110010100110101 |
3 | 210020001100021120200222 |
4 | 3032300321212110311 |
5 | 12114134333040201 |
6 | 245553542544125 |
7 | 22016434146602 |
oct | 3166071462465 |
9 | 706040246628 |
10 | 222011221301 |
11 | 86177601591 |
12 | 3703b138045 |
13 | 17c2159c88c |
14 | aa615436a9 |
15 | 5b95a6c91b |
hex | 33b0e66535 |
222011221301 has 2 divisors, whose sum is σ = 222011221302. Its totient is φ = 222011221300.
The previous prime is 222011221283. The next prime is 222011221307. The reversal of 222011221301 is 103122110222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 165324373201 + 56686848100 = 406601^2 + 238090^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222011221301 is a prime.
It is a super-2 number, since 2×2220112213012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 222011221301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222011221307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111005610650 + 111005610651.
It is an arithmetic number, because the mean of its divisors is an integer number (111005610651).
Almost surely, 2222011221301 is an apocalyptic number.
It is an amenable number.
222011221301 is a deficient number, since it is larger than the sum of its proper divisors (1).
222011221301 is an equidigital number, since it uses as much as digits as its factorization.
222011221301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 222011221301 its reverse (103122110222), we get a palindrome (325133331523).
The spelling of 222011221301 in words is "two hundred twenty-two billion, eleven million, two hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •