Base | Representation |
---|---|
bin | 101101100001011101111101… |
… | …101111110111000001110001 |
3 | 222020220002012020020011211112 |
4 | 231201131331233313001301 |
5 | 202220233144102414301 |
6 | 1545452043331523105 |
7 | 60112561153303415 |
oct | 5541357557670161 |
9 | 866802166204745 |
10 | 200212010201201 |
11 | 58880489273469 |
12 | 1a556519159495 |
13 | 8793bb08a4b8b |
14 | 3762454c1ad45 |
15 | 1822e91aeb9bb |
hex | b6177dbf7071 |
200212010201201 has 2 divisors, whose sum is σ = 200212010201202. Its totient is φ = 200212010201200.
The previous prime is 200212010201197. The next prime is 200212010201219. The reversal of 200212010201201 is 102102010212002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118457428954225 + 81754581246976 = 10883815^2 + 9041824^2 .
It is a cyclic number.
It is not a de Polignac number, because 200212010201201 - 22 = 200212010201197 is a prime.
It is not a weakly prime, because it can be changed into another prime (200212010207201) 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, 100106005100600 + 100106005100601.
It is an arithmetic number, because the mean of its divisors is an integer number (100106005100601).
Almost surely, 2200212010201201 is an apocalyptic number.
It is an amenable number.
200212010201201 is a deficient number, since it is larger than the sum of its proper divisors (1).
200212010201201 is an equidigital number, since it uses as much as digits as its factorization.
200212010201201 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 200212010201201 its reverse (102102010212002), we get a palindrome (302314020413203).
The spelling of 200212010201201 in words is "two hundred trillion, two hundred twelve billion, ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •