Base | Representation |
---|---|
bin | 101101100001011100010011… |
… | …001010110011000111111101 |
3 | 222020212220120121121021110202 |
4 | 231201130103022303013331 |
5 | 202220221013324212424 |
6 | 1545451150054413245 |
7 | 60112465641560312 |
oct | 5541342312630775 |
9 | 866786517537422 |
10 | 200210222100989 |
11 | 5887a7509a72a1 |
12 | 1a5560ba361225 |
13 | 87939872c0309 |
14 | 3762325560d09 |
15 | 1822dd9b442ae |
hex | b617132b31fd |
200210222100989 has 2 divisors, whose sum is σ = 200210222100990. Its totient is φ = 200210222100988.
The previous prime is 200210222100953. The next prime is 200210222101027. The reversal of 200210222100989 is 989001222012002.
It is an a-pointer prime, because the next prime (200210222101027) can be obtained adding 200210222100989 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140666312840089 + 59543909260900 = 11860283^2 + 7716470^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200210222100989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210222100289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105111050494 + 100105111050495.
It is an arithmetic number, because the mean of its divisors is an integer number (100105111050495).
Almost surely, 2200210222100989 is an apocalyptic number.
It is an amenable number.
200210222100989 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210222100989 is an equidigital number, since it uses as much as digits as its factorization.
200210222100989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 38.
The spelling of 200210222100989 in words is "two hundred trillion, two hundred ten billion, two hundred twenty-two million, one hundred thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •