Base | Representation |
---|---|
bin | 101101100001011100001100… |
… | …100011011100011000001111 |
3 | 222020212220021212202220102111 |
4 | 231201130030203130120033 |
5 | 202220220301421332121 |
6 | 1545451131052004451 |
7 | 60112463123344243 |
oct | 5541341443343017 |
9 | 866786255686374 |
10 | 200210111120911 |
11 | 5887a6a4296321 |
12 | 1a556089160727 |
13 | 879396a303b28 |
14 | 3762314912423 |
15 | 1822dd00212e1 |
hex | b6170c8dc60f |
200210111120911 has 2 divisors, whose sum is σ = 200210111120912. Its totient is φ = 200210111120910.
The previous prime is 200210111120863. The next prime is 200210111120939. The reversal of 200210111120911 is 119021111012002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210111120911 - 27 = 200210111120783 is a prime.
It is a super-2 number, since 2×2002101111209112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210111127911) 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, 100105055560455 + 100105055560456.
It is an arithmetic number, because the mean of its divisors is an integer number (100105055560456).
Almost surely, 2200210111120911 is an apocalyptic number.
200210111120911 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210111120911 is an equidigital number, since it uses as much as digits as its factorization.
200210111120911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 22.
Adding to 200210111120911 its reverse (119021111012002), we get a palindrome (319231222132913).
The spelling of 200210111120911 in words is "two hundred trillion, two hundred ten billion, one hundred eleven million, one hundred twenty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •