Base | Representation |
---|---|
bin | 101101111110011010011100… |
… | …110011110110101101001001 |
3 | 222111221020101101212100201112 |
4 | 231332122130303312231021 |
5 | 203000330323401401301 |
6 | 1554013523055100105 |
7 | 60406355532652025 |
oct | 5576323463665511 |
9 | 874836341770645 |
10 | 202201101200201 |
11 | 5947800728a344 |
12 | 1a817b17811635 |
13 | 88a963602346c |
14 | 37d082a927385 |
15 | 1859aac0129bb |
hex | b7e69ccf6b49 |
202201101200201 has 2 divisors, whose sum is σ = 202201101200202. Its totient is φ = 202201101200200.
The previous prime is 202201101200177. The next prime is 202201101200237. The reversal of 202201101200201 is 102002101102202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 141507107496976 + 60693993703225 = 11895676^2 + 7790635^2 .
It is a cyclic number.
It is not a de Polignac number, because 202201101200201 - 214 = 202201101183817 is a prime.
It is not a weakly prime, because it can be changed into another prime (202201101200101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101100550600100 + 101100550600101.
It is an arithmetic number, because the mean of its divisors is an integer number (101100550600101).
Almost surely, 2202201101200201 is an apocalyptic number.
It is an amenable number.
202201101200201 is a deficient number, since it is larger than the sum of its proper divisors (1).
202201101200201 is an equidigital number, since it uses as much as digits as its factorization.
202201101200201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 202201101200201 its reverse (102002101102202), we get a palindrome (304203202302403).
The spelling of 202201101200201 in words is "two hundred two trillion, two hundred one billion, one hundred one million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •