Search a number
-
+
10229111 is a prime number
BaseRepresentation
bin100111000001…
…010101110111
3201020200200222
4213001111313
510104312421
61003124555
7152642324
oct47012567
921220628
1010229111
115857312
12351375b
132171c39
141503b4b
15d70cab
hex9c1577

10229111 has 2 divisors, whose sum is σ = 10229112. Its totient is φ = 10229110.

The previous prime is 10229081. The next prime is 10229117. The reversal of 10229111 is 11192201.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10229111 - 218 = 9966967 is a prime.

It is a Sophie Germain prime.

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 10229111.

It is a congruent number.

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

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

Almost surely, 210229111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 17.

The square root of 10229111 is about 3198.2981411995. The cubic root of 10229111 is about 217.0764099097.

The spelling of 10229111 in words is "ten million, two hundred twenty-nine thousand, one hundred eleven".