Base | Representation |
---|---|
bin | 101101100001011110001001… |
… | …000100010001000110000101 |
3 | 222020220002200110120001022212 |
4 | 231201132021010101012011 |
5 | 202220234041211201404 |
6 | 1545452114234033205 |
7 | 60112565650361042 |
oct | 5541361104210605 |
9 | 866802613501285 |
10 | 200212200100229 |
11 | 58880576487409 |
12 | 1a556570878805 |
13 | 8793c11033675 |
14 | 37624721301c9 |
15 | 1822ea360d06e |
hex | b61789111185 |
200212200100229 has 2 divisors, whose sum is σ = 200212200100230. Its totient is φ = 200212200100228.
The previous prime is 200212200100183. The next prime is 200212200100259. The reversal of 200212200100229 is 922001002212002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134572226677729 + 65639973422500 = 11600527^2 + 8101850^2 .
It is a cyclic number.
It is not a de Polignac number, because 200212200100229 - 28 = 200212200099973 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200212200100259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100106100050114 + 100106100050115.
It is an arithmetic number, because the mean of its divisors is an integer number (100106100050115).
Almost surely, 2200212200100229 is an apocalyptic number.
It is an amenable number.
200212200100229 is a deficient number, since it is larger than the sum of its proper divisors (1).
200212200100229 is an equidigital number, since it uses as much as digits as its factorization.
200212200100229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
The spelling of 200212200100229 in words is "two hundred trillion, two hundred twelve billion, two hundred million, one hundred thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •