Search a number
-
+
910139 is a prime number
BaseRepresentation
bin11011110001100111011
31201020110212
43132030323
5213111024
631301335
710510316
oct3361473
91636425
10910139
1157188a
1237a84b
1325b359
1419997d
1512ea0e
hexde33b

910139 has 2 divisors, whose sum is σ = 910140. Its totient is φ = 910138.

The previous prime is 910127. The next prime is 910141. The reversal of 910139 is 931019.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 910139 - 212 = 906043 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 910139.

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

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

2910139 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 243, while the sum is 23.

The square root of 910139 is about 954.0120544312. The cubic root of 910139 is about 96.9101445847.

Subtracting from 910139 its sum of digits (23), we obtain a square (910116 = 9542).

The spelling of 910139 in words is "nine hundred ten thousand, one hundred thirty-nine".