Base | Representation |
---|---|
bin | 110010011110101011000010… |
… | …011101010111111001000101 |
3 | 1002010001221221010021210211012 |
4 | 302132223002131113321011 |
5 | 213044403212213311211 |
6 | 2104102013030252005 |
7 | 64522462533452321 |
oct | 6236530235277105 |
9 | 1063057833253735 |
10 | 222010122010181 |
11 | 64814a670a023a |
12 | 20a970707b7005 |
13 | 96b5606b732cb |
14 | 3cb74c0b74981 |
15 | 1a9eed5861d8b |
hex | c9eac2757e45 |
222010122010181 has 2 divisors, whose sum is σ = 222010122010182. Its totient is φ = 222010122010180.
The previous prime is 222010122010169. The next prime is 222010122010219. The reversal of 222010122010181 is 181010221010222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 220521490201156 + 1488631809025 = 14849966^2 + 1220095^2 .
It is a cyclic number.
It is not a de Polignac number, because 222010122010181 - 222 = 222010117815877 is a prime.
It is a super-2 number, since 2×2220101220101812 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222010122010151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111005061005090 + 111005061005091.
It is an arithmetic number, because the mean of its divisors is an integer number (111005061005091).
Almost surely, 2222010122010181 is an apocalyptic number.
It is an amenable number.
222010122010181 is a deficient number, since it is larger than the sum of its proper divisors (1).
222010122010181 is an equidigital number, since it uses as much as digits as its factorization.
222010122010181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 23.
The spelling of 222010122010181 in words is "two hundred twenty-two trillion, ten billion, one hundred twenty-two million, ten thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •