Base | Representation |
---|---|
bin | 101101100001010011110011… |
… | …100100110101100010000011 |
3 | 222020212001001000202021222111 |
4 | 231201103303210311202003 |
5 | 202220043324120333331 |
6 | 1545443041105520151 |
7 | 60112023641200531 |
oct | 5541236344654203 |
9 | 866761030667874 |
10 | 200201102121091 |
11 | 588768a0a08425 |
12 | 1a554394043057 |
13 | 8792b62a222c6 |
14 | 3761adc237151 |
15 | 1822a54167db1 |
hex | b614f3935883 |
200201102121091 has 2 divisors, whose sum is σ = 200201102121092. Its totient is φ = 200201102121090.
The previous prime is 200201102121019. The next prime is 200201102121143. The reversal of 200201102121091 is 190121201102002.
Together with previous prime (200201102121019) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200201102121091 - 27 = 200201102120963 is a prime.
It is not a weakly prime, because it can be changed into another prime (200201102121001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100100551060545 + 100100551060546.
It is an arithmetic number, because the mean of its divisors is an integer number (100100551060546).
Almost surely, 2200201102121091 is an apocalyptic number.
200201102121091 is a deficient number, since it is larger than the sum of its proper divisors (1).
200201102121091 is an equidigital number, since it uses as much as digits as its factorization.
200201102121091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 200201102121091 its reverse (190121201102002), we get a palindrome (390322303223093).
The spelling of 200201102121091 in words is "two hundred trillion, two hundred one billion, one hundred two million, one hundred twenty-one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •