Base | Representation |
---|---|
bin | 101101100001011110001010… |
… | …010000001101111000111001 |
3 | 222020220002201212000120110022 |
4 | 231201132022100031320321 |
5 | 202220234111310310131 |
6 | 1545452120224500225 |
7 | 60112566311533121 |
oct | 5541361220157071 |
9 | 866802655016408 |
10 | 200212220010041 |
11 | 588805867459a8 |
12 | 1a55657747a675 |
13 | 8793c151b4a15 |
14 | 3762474a33c81 |
15 | 1822ea524237b |
hex | b6178a40de39 |
200212220010041 has 2 divisors, whose sum is σ = 200212220010042. Its totient is φ = 200212220010040.
The previous prime is 200212220009983. The next prime is 200212220010071. The reversal of 200212220010041 is 140010022212002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 187827134640016 + 12385085370025 = 13705004^2 + 3519245^2 .
It is a cyclic number.
It is not a de Polignac number, because 200212220010041 - 210 = 200212220009017 is a prime.
It is not a weakly prime, because it can be changed into another prime (200212220010071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100106110005020 + 100106110005021.
It is an arithmetic number, because the mean of its divisors is an integer number (100106110005021).
Almost surely, 2200212220010041 is an apocalyptic number.
It is an amenable number.
200212220010041 is a deficient number, since it is larger than the sum of its proper divisors (1).
200212220010041 is an equidigital number, since it uses as much as digits as its factorization.
200212220010041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 200212220010041 its reverse (140010022212002), we get a palindrome (340222242222043).
The spelling of 200212220010041 in words is "two hundred trillion, two hundred twelve billion, two hundred twenty million, ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •