Base | Representation |
---|---|
bin | 1011101001011011100… |
… | …1011000101001011101 |
3 | 201010111022200100221022 |
4 | 2322112321120221131 |
5 | 11234301112334211 |
6 | 231531424013525 |
7 | 20312444652332 |
oct | 2722671305135 |
9 | 633438610838 |
10 | 200100121181 |
11 | 77953335784 |
12 | 329451612a5 |
13 | 15b3bca5b8c |
14 | 9983504989 |
15 | 531214ebdb |
hex | 2e96e58a5d |
200100121181 has 2 divisors, whose sum is σ = 200100121182. Its totient is φ = 200100121180.
The previous prime is 200100121079. The next prime is 200100121183. The reversal of 200100121181 is 181121001002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131793685156 + 68306436025 = 363034^2 + 261355^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200100121181 is a prime.
It is a super-2 number, since 2×2001001211812 (a number of 23 digits) contains 22 as substring.
Together with 200100121183, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200100121183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050060590 + 100050060591.
It is an arithmetic number, because the mean of its divisors is an integer number (100050060591).
Almost surely, 2200100121181 is an apocalyptic number.
It is an amenable number.
200100121181 is a deficient number, since it is larger than the sum of its proper divisors (1).
200100121181 is an equidigital number, since it uses as much as digits as its factorization.
200100121181 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 17.
Adding to 200100121181 its reverse (181121001002), we get a palindrome (381221122183).
The spelling of 200100121181 in words is "two hundred billion, one hundred million, one hundred twenty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •