Search a number
-
+
10579141 is a prime number
BaseRepresentation
bin101000010110…
…110011000101
3201220110212001
4220112303011
510202013031
61014425301
7155630656
oct50266305
921813761
1010579141
115a762a1
123662231
132265361
14159552d
15dde861
hexa16cc5

10579141 has 2 divisors, whose sum is σ = 10579142. Its totient is φ = 10579140.

The previous prime is 10579139. The next prime is 10579157. The reversal of 10579141 is 14197501.

10579141 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10562500 + 16641 = 3250^2 + 129^2 .

It is a cyclic number.

It is not a de Polignac number, because 10579141 - 21 = 10579139 is a prime.

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

Together with 10579139, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10579741) 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, 5289570 + 5289571.

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

Almost surely, 210579141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1260, while the sum is 28.

The square root of 10579141 is about 3252.5591462724. The cubic root of 10579141 is about 219.5247385044.

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