Base | Representation |
---|---|
bin | 101101011110100001111011… |
… | …100111111100111101011001 |
3 | 222020011210001112110201100001 |
4 | 231132201323213330331121 |
5 | 202203431201421023001 |
6 | 1545215213201413001 |
7 | 60062153002326322 |
oct | 5536417347747531 |
9 | 866153045421301 |
10 | 200010111111001 |
11 | 588028a2518734 |
12 | 1a52337163a161 |
13 | 877ab45cb02b9 |
14 | 375678082b449 |
15 | 181cac6a99001 |
hex | b5e87b9fcf59 |
200010111111001 has 2 divisors, whose sum is σ = 200010111111002. Its totient is φ = 200010111111000.
The previous prime is 200010111110977. The next prime is 200010111111023. The reversal of 200010111111001 is 100111111010002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 192664254926025 + 7345856184976 = 13880355^2 + 2710324^2 .
It is a cyclic number.
It is not a de Polignac number, because 200010111111001 - 29 = 200010111110489 is a prime.
It is not a weakly prime, because it can be changed into another prime (200010111121001) 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, 100005055555500 + 100005055555501.
It is an arithmetic number, because the mean of its divisors is an integer number (100005055555501).
Almost surely, 2200010111111001 is an apocalyptic number.
It is an amenable number.
200010111111001 is a deficient number, since it is larger than the sum of its proper divisors (1).
200010111111001 is an equidigital number, since it uses as much as digits as its factorization.
200010111111001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 200010111111001 its reverse (100111111010002), we get a palindrome (300121222121003).
The spelling of 200010111111001 in words is "two hundred trillion, ten billion, one hundred eleven million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •