Search a number
-
+
200560141 is a prime number
BaseRepresentation
bin10111111010001…
…00111000001101
3111222101111210101
423331010320031
5402320411031
631522411101
74653506305
oct1375047015
9458344711
10200560141
11a3235891
1257200a91
1332722252
141c8ca605
151291a361
hexbf44e0d

200560141 has 2 divisors, whose sum is σ = 200560142. Its totient is φ = 200560140.

The previous prime is 200560133. The next prime is 200560147. The reversal of 200560141 is 141065002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105575625 + 94984516 = 10275^2 + 9746^2 .

It is a cyclic number.

It is not a de Polignac number, because 200560141 - 23 = 200560133 is a prime.

It is equal to p11108314 and since 200560141 and 11108314 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

Almost surely, 2200560141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 240, while the sum is 19.

The square root of 200560141 is about 14161.9257518178. The cubic root of 200560141 is about 585.3489928220.

It can be divided in two parts, 200560 and 141, that multiplied together give a triangular number (28278960 = T7520).

The spelling of 200560141 in words is "two hundred million, five hundred sixty thousand, one hundred forty-one".