Search a number
-
+
200164571 is a prime number
BaseRepresentation
bin10111110111001…
…00010011011011
3111221122102011122
423323210103123
5402220231241
631510115455
74650241115
oct1373442333
9457572148
10200164571
11a2a95672
125704bb8b
1332614199
141c8263b5
151288d04b
hexbee44db

200164571 has 2 divisors, whose sum is σ = 200164572. Its totient is φ = 200164570.

The previous prime is 200164529. The next prime is 200164597. The reversal of 200164571 is 175461002.

It is an a-pointer prime, because the next prime (200164597) can be obtained adding 200164571 to its sum of digits (26).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 200164571 - 222 = 195970267 is a prime.

It is a super-2 number, since 2×2001645712 = 80131710967228082, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 200164571.

It is not a weakly prime, because it can be changed into another prime (200164271) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100082285 + 100082286.

It is an arithmetic number, because the mean of its divisors is an integer number (100082286).

Almost surely, 2200164571 is an apocalyptic number.

200164571 is a deficient number, since it is larger than the sum of its proper divisors (1).

200164571 is an equidigital number, since it uses as much as digits as its factorization.

200164571 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 1680, while the sum is 26.

The square root of 200164571 is about 14147.9528907895. The cubic root of 200164571 is about 584.9639065076.

The spelling of 200164571 in words is "two hundred million, one hundred sixty-four thousand, five hundred seventy-one".