Base | Representation |
---|---|
bin | 101101100001100110011100… |
… | …110110101001101110010001 |
3 | 222020220221201020201000200112 |
4 | 231201212130312221232101 |
5 | 202220410324213310001 |
6 | 1545500151425331105 |
7 | 60113333024351561 |
oct | 5541463466515621 |
9 | 866827636630615 |
10 | 200221122010001 |
11 | 58884334691264 |
12 | 1a558240796a95 |
13 | 8794a03571911 |
14 | 3762a7b018da1 |
15 | 1823326a11cbb |
hex | b6199cda9b91 |
200221122010001 has 2 divisors, whose sum is σ = 200221122010002. Its totient is φ = 200221122010000.
The previous prime is 200221122009973. The next prime is 200221122010003. The reversal of 200221122010001 is 100010221122002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 156826756256401 + 43394365753600 = 12523049^2 + 6587440^2 .
It is a cyclic number.
It is not a de Polignac number, because 200221122010001 - 226 = 200221054901137 is a prime.
Together with 200221122010003, 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 (200221122010003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100110561005000 + 100110561005001.
It is an arithmetic number, because the mean of its divisors is an integer number (100110561005001).
Almost surely, 2200221122010001 is an apocalyptic number.
It is an amenable number.
200221122010001 is a deficient number, since it is larger than the sum of its proper divisors (1).
200221122010001 is an equidigital number, since it uses as much as digits as its factorization.
200221122010001 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 200221122010001 its reverse (100010221122002), we get a palindrome (300231343132003).
The spelling of 200221122010001 in words is "two hundred trillion, two hundred twenty-one billion, one hundred twenty-two million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •