Base | Representation |
---|---|
bin | 101101011111111111111111… |
… | …000101110100000101110001 |
3 | 222020112102201200202201212221 |
4 | 231133333333011310011301 |
5 | 202212110013324031342 |
6 | 1545333434245321041 |
7 | 60102356426253565 |
oct | 5537777705640561 |
9 | 866472650681787 |
10 | 200111101002097 |
11 | 588417066a264a |
12 | 1a53aa56a06181 |
13 | 878751b8ca8cc |
14 | 375b6011276a5 |
15 | 1820537b69a67 |
hex | b5ffff174171 |
200111101002097 has 2 divisors, whose sum is σ = 200111101002098. Its totient is φ = 200111101002096.
The previous prime is 200111101001983. The next prime is 200111101002143. The reversal of 200111101002097 is 790200101111002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117629121724416 + 82481979277681 = 10845696^2 + 9081959^2 .
It is a cyclic number.
It is not a de Polignac number, because 200111101002097 - 239 = 199561345188209 is a prime.
It is not a weakly prime, because it can be changed into another prime (200111101072097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100055550501048 + 100055550501049.
It is an arithmetic number, because the mean of its divisors is an integer number (100055550501049).
Almost surely, 2200111101002097 is an apocalyptic number.
It is an amenable number.
200111101002097 is a deficient number, since it is larger than the sum of its proper divisors (1).
200111101002097 is an equidigital number, since it uses as much as digits as its factorization.
200111101002097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 25.
Adding to 200111101002097 its reverse (790200101111002), we get a palindrome (990311202113099).
The spelling of 200111101002097 in words is "two hundred trillion, one hundred eleven billion, one hundred one million, two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •