Base | Representation |
---|---|
bin | 111110111100101… |
… | …1001111000001001 |
3 | 12110012110212222002 |
4 | 1331321121320021 |
5 | 13311210401301 |
6 | 545331440345 |
7 | 103225256036 |
oct | 17571317011 |
9 | 5405425862 |
10 | 2112200201 |
11 | 994311301 |
12 | 4ab4560b5 |
13 | 2787a0007 |
14 | 16074438d |
15 | c567716b |
hex | 7de59e09 |
2112200201 has 2 divisors, whose sum is σ = 2112200202. Its totient is φ = 2112200200.
The previous prime is 2112200197. The next prime is 2112200203. The reversal of 2112200201 is 1020022112.
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., 1289887225 + 822312976 = 35915^2 + 28676^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112200201 - 22 = 2112200197 is a prime.
It is a super-2 number, since 2×21122002012 = 8922779378208880802, which contains 22 as substring.
Together with 2112200203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2112200203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056100100 + 1056100101.
It is an arithmetic number, because the mean of its divisors is an integer number (1056100101).
Almost surely, 22112200201 is an apocalyptic number.
It is an amenable number.
2112200201 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112200201 is an equidigital number, since it uses as much as digits as its factorization.
2112200201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 2112200201 is about 45958.6792782386. The cubic root of 2112200201 is about 1283.0542705899.
Adding to 2112200201 its reverse (1020022112), we get a palindrome (3132222313).
The spelling of 2112200201 in words is "two billion, one hundred twelve million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •