Base | Representation |
---|---|
bin | 101101011110011010011110… |
… | …001100101001101010011001 |
3 | 222020011000101022110012022222 |
4 | 231132122132030221222121 |
5 | 202203313300403101131 |
6 | 1545211410305553425 |
7 | 60061450341361346 |
oct | 5536323614515231 |
9 | 866130338405288 |
10 | 200002101222041 |
11 | 587aa462106598 |
12 | 1a5218b7045875 |
13 | 877a16a6b7031 |
14 | 3756220b0b7cd |
15 | 181c7a879887b |
hex | b5e69e329a99 |
200002101222041 has 2 divisors, whose sum is σ = 200002101222042. Its totient is φ = 200002101222040.
The previous prime is 200002101222023. The next prime is 200002101222043. The reversal of 200002101222041 is 140222101200002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121286257104016 + 78715844118025 = 11013004^2 + 8872195^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200002101222041 is a prime.
Together with 200002101222043, 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 (200002101222043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100001050611020 + 100001050611021.
It is an arithmetic number, because the mean of its divisors is an integer number (100001050611021).
Almost surely, 2200002101222041 is an apocalyptic number.
It is an amenable number.
200002101222041 is a deficient number, since it is larger than the sum of its proper divisors (1).
200002101222041 is an equidigital number, since it uses as much as digits as its factorization.
200002101222041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 200002101222041 its reverse (140222101200002), we get a palindrome (340224202422043).
The spelling of 200002101222041 in words is "two hundred trillion, two billion, one hundred one million, two hundred twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •