Base | Representation |
---|---|
bin | 101101100001010010111000… |
… | …100000110001101101100111 |
3 | 222020211221110222011100100002 |
4 | 231201102320200301231213 |
5 | 202220034311431414002 |
6 | 1545442354511011515 |
7 | 60111660246415202 |
oct | 5541227040615547 |
9 | 866757428140302 |
10 | 200200111201127 |
11 | 58876432626604 |
12 | 1a554158209b9b |
13 | 8792a3564402b |
14 | 3761a467b0939 |
15 | 18229e717c002 |
hex | b614b8831b67 |
200200111201127 has 2 divisors, whose sum is σ = 200200111201128. Its totient is φ = 200200111201126.
The previous prime is 200200111201081. The next prime is 200200111201193. The reversal of 200200111201127 is 721102111002002.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200200111201127 - 214 = 200200111184743 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200200111201099 and 200200111201108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200200111200127) 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, 100100055600563 + 100100055600564.
It is an arithmetic number, because the mean of its divisors is an integer number (100100055600564).
Almost surely, 2200200111201127 is an apocalyptic number.
200200111201127 is a deficient number, since it is larger than the sum of its proper divisors (1).
200200111201127 is an equidigital number, since it uses as much as digits as its factorization.
200200111201127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 200200111201127 its reverse (721102111002002), we get a palindrome (921302222203129).
The spelling of 200200111201127 in words is "two hundred trillion, two hundred billion, one hundred eleven million, two hundred one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •