Base | Representation |
---|---|
bin | 101101011110100010110001… |
… | …010001001101101111100001 |
3 | 222020011212101020222220201021 |
4 | 231132202301101031233201 |
5 | 202203440022321320342 |
6 | 1545215442352005441 |
7 | 60062214211303462 |
oct | 5536426121155741 |
9 | 866155336886637 |
10 | 200011011120097 |
11 | 58803214556901 |
12 | 1a523582b30881 |
13 | 877ac5a5aab68 |
14 | 375682818ad69 |
15 | 181cb2aac8567 |
hex | b5e8b144dbe1 |
200011011120097 has 2 divisors, whose sum is σ = 200011011120098. Its totient is φ = 200011011120096.
The previous prime is 200011011120091. The next prime is 200011011120101. The reversal of 200011011120097 is 790021110110002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 142901008882641 + 57110002237456 = 11954121^2 + 7557116^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200011011120097 is a prime.
It is not a weakly prime, because it can be changed into another prime (200011011120091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005505560048 + 100005505560049.
It is an arithmetic number, because the mean of its divisors is an integer number (100005505560049).
Almost surely, 2200011011120097 is an apocalyptic number.
It is an amenable number.
200011011120097 is a deficient number, since it is larger than the sum of its proper divisors (1).
200011011120097 is an equidigital number, since it uses as much as digits as its factorization.
200011011120097 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 200011011120097 its reverse (790021110110002), we get a palindrome (990032121230099).
The spelling of 200011011120097 in words is "two hundred trillion, eleven billion, eleven million, one hundred twenty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •