Search a number
-
+
10550429 is a prime number
BaseRepresentation
bin101000001111…
…110010011101
3201212000110122
4220033302131
510200103204
61014044325
7155451161
oct50176235
921760418
1010550429
115a5676a
1236496a5
132255276
141588ca1
15dd60be
hexa0fc9d

10550429 has 2 divisors, whose sum is σ = 10550430. Its totient is φ = 10550428.

The previous prime is 10550413. The next prime is 10550467. The reversal of 10550429 is 92405501.

10550429 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., 10413529 + 136900 = 3227^2 + 370^2 .

It is a cyclic number.

It is not a de Polignac number, because 10550429 - 24 = 10550413 is a prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 10550398 and 10550407.

It is a congruent number.

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

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

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

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

Almost surely, 210550429 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10550429 is about 3248.1423921990. The cubic root of 10550429 is about 219.3259603914.

The spelling of 10550429 in words is "ten million, five hundred fifty thousand, four hundred twenty-nine".