Base | Representation |
---|---|
bin | 100000000010000001110… |
… | …000011101111111100101 |
3 | 21210102200102120010202212 |
4 | 200002001300131333211 |
5 | 242031024224102211 |
6 | 4403114544013205 |
7 | 315013536114062 |
oct | 40020160357745 |
9 | 7712612503685 |
10 | 2201200222181 |
11 | 77958415a744 |
12 | 2b6735601205 |
13 | 12c759424b8c |
14 | 7877811bc69 |
15 | 3c3d19d338b |
hex | 20081c1dfe5 |
2201200222181 has 2 divisors, whose sum is σ = 2201200222182. Its totient is φ = 2201200222180.
The previous prime is 2201200222069. The next prime is 2201200222183. The reversal of 2201200222181 is 1812220021022.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1234340998081 + 966859224100 = 1111009^2 + 983290^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2201200222181 is a prime.
It is a super-2 number, since 2×22012002221812 (a number of 25 digits) contains 22 as substring.
Together with 2201200222183, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201200222183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100600111090 + 1100600111091.
It is an arithmetic number, because the mean of its divisors is an integer number (1100600111091).
Almost surely, 22201200222181 is an apocalyptic number.
It is an amenable number.
2201200222181 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201200222181 is an equidigital number, since it uses as much as digits as its factorization.
2201200222181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 23.
The spelling of 2201200222181 in words is "two trillion, two hundred one billion, two hundred million, two hundred twenty-two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •