Search a number
-
+
10559141 is a prime number
BaseRepresentation
bin101000010001…
…111010100101
3201212110102022
4220101322211
510200343031
61014152525
7155515445
oct50217245
921773368
1010559141
115a6226a
123652745
132259218
14158c125
15dd897b
hexa11ea5

10559141 has 2 divisors, whose sum is σ = 10559142. Its totient is φ = 10559140.

The previous prime is 10559119. The next prime is 10559147. The reversal of 10559141 is 14195501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9302500 + 1256641 = 3050^2 + 1121^2 .

It is a cyclic number.

It is not a de Polignac number, because 10559141 - 26 = 10559077 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210559141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10559141 is about 3249.4831896780. The cubic root of 10559141 is about 219.3863131370.

The spelling of 10559141 in words is "ten million, five hundred fifty-nine thousand, one hundred forty-one".