Base | Representation |
---|---|
bin | 101101011111110111100001… |
… | …111100111110011010001011 |
3 | 222020111120021222102101002122 |
4 | 231133313201330332122023 |
5 | 202211432420141224321 |
6 | 1545325333331321455 |
7 | 60101615435643521 |
oct | 5537674174763213 |
9 | 866446258371078 |
10 | 200102022211211 |
11 | 5883887798668a |
12 | 1a53914245028b |
13 | 8786702a216b3 |
14 | 375adbd482311 |
15 | 18201a5ac78ab |
hex | b5fde1f3e68b |
200102022211211 has 2 divisors, whose sum is σ = 200102022211212. Its totient is φ = 200102022211210.
The previous prime is 200102022211199. The next prime is 200102022211261. The reversal of 200102022211211 is 112112220201002.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200102022211211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200102022211211.
It is not a weakly prime, because it can be changed into another prime (200102022211261) 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, 100051011105605 + 100051011105606.
It is an arithmetic number, because the mean of its divisors is an integer number (100051011105606).
Almost surely, 2200102022211211 is an apocalyptic number.
200102022211211 is a deficient number, since it is larger than the sum of its proper divisors (1).
200102022211211 is an equidigital number, since it uses as much as digits as its factorization.
200102022211211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 200102022211211 its reverse (112112220201002), we get a palindrome (312214242412213).
The spelling of 200102022211211 in words is "two hundred trillion, one hundred two billion, twenty-two million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •