Base | Representation |
---|---|
bin | 101101011111110101110110… |
… | …000100010111110100111001 |
3 | 222020111101121211120211120211 |
4 | 231133311312010113310321 |
5 | 202211420213311223001 |
6 | 1545324433552551121 |
7 | 60101522540126134 |
oct | 5537656604276471 |
9 | 866441554524524 |
10 | 200100212211001 |
11 | 58838029211743 |
12 | 1a5389182524a1 |
13 | 87864a4a3c95b |
14 | 375ac8ad2521b |
15 | 18200ebc46351 |
hex | b5fd76117d39 |
200100212211001 has 2 divisors, whose sum is σ = 200100212211002. Its totient is φ = 200100212211000.
The previous prime is 200100212210959. The next prime is 200100212211007. The reversal of 200100212211001 is 100112212001002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189671840179600 + 10428372031401 = 13772140^2 + 3229299^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200100212211001 is a prime.
It is not a weakly prime, because it can be changed into another prime (200100212211007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050106105500 + 100050106105501.
It is an arithmetic number, because the mean of its divisors is an integer number (100050106105501).
Almost surely, 2200100212211001 is an apocalyptic number.
It is an amenable number.
200100212211001 is a deficient number, since it is larger than the sum of its proper divisors (1).
200100212211001 is an equidigital number, since it uses as much as digits as its factorization.
200100212211001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200100212211001 its reverse (100112212001002), we get a palindrome (300212424212003).
The spelling of 200100212211001 in words is "two hundred trillion, one hundred billion, two hundred twelve million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •