Base | Representation |
---|---|
bin | 101101111110100011101010… |
… | …111001011011101110100001 |
3 | 222111222011221100111110210112 |
4 | 231332203222321123232201 |
5 | 203001011112303020001 |
6 | 1554022241310541105 |
7 | 60410156054513354 |
oct | 5576435271335641 |
9 | 874864840443715 |
10 | 202211001220001 |
11 | 59481227616794 |
12 | 1a819a1b207795 |
13 | 88aa5530a6147 |
14 | 37d10c96a229b |
15 | 1859e8b221cbb |
hex | b7e8eae5bba1 |
202211001220001 has 2 divisors, whose sum is σ = 202211001220002. Its totient is φ = 202211001220000.
The previous prime is 202211001219979. The next prime is 202211001220031. The reversal of 202211001220001 is 100022100112202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 178255849860001 + 23955151360000 = 13351249^2 + 4894400^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202211001220001 is a prime.
It is not a weakly prime, because it can be changed into another prime (202211001220031) 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, 101105500610000 + 101105500610001.
It is an arithmetic number, because the mean of its divisors is an integer number (101105500610001).
Almost surely, 2202211001220001 is an apocalyptic number.
It is an amenable number.
202211001220001 is a deficient number, since it is larger than the sum of its proper divisors (1).
202211001220001 is an equidigital number, since it uses as much as digits as its factorization.
202211001220001 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 202211001220001 its reverse (100022100112202), we get a palindrome (302233101332203).
The spelling of 202211001220001 in words is "two hundred two trillion, two hundred eleven billion, one million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •