Base | Representation |
---|---|
bin | 101101011111110111101101… |
… | …001101100010001000101111 |
3 | 222020111120210010211222111022 |
4 | 231133313231031202020233 |
5 | 202211433312020214411 |
6 | 1545325404200044355 |
7 | 60101623221326345 |
oct | 5537675515421057 |
9 | 866446703758438 |
10 | 200102211101231 |
11 | 5883896457053a |
12 | 1a5391957636bb |
13 | 8786732bb8b3a |
14 | 375adda5b1995 |
15 | 18201b7489edb |
hex | b5fded36222f |
200102211101231 has 2 divisors, whose sum is σ = 200102211101232. Its totient is φ = 200102211101230.
The previous prime is 200102211101189. The next prime is 200102211101249. The reversal of 200102211101231 is 132101112201002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200102211101231 - 242 = 195704164590127 is a prime.
It is a super-2 number, since 2×2001022111012312 (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 (200102211101281) 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, 100051105550615 + 100051105550616.
It is an arithmetic number, because the mean of its divisors is an integer number (100051105550616).
Almost surely, 2200102211101231 is an apocalyptic number.
200102211101231 is a deficient number, since it is larger than the sum of its proper divisors (1).
200102211101231 is an equidigital number, since it uses as much as digits as its factorization.
200102211101231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 200102211101231 its reverse (132101112201002), we get a palindrome (332203323302233).
The spelling of 200102211101231 in words is "two hundred trillion, one hundred two billion, two hundred eleven million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •