Search a number
-
+
10039013 is a prime number
BaseRepresentation
bin100110010010…
…111011100101
3200220000221022
4212102323211
510032222023
6555100525
7151221155
oct46227345
920800838
1010039013
115737506
123441745
13210655a
141494765
15d347c8
hex992ee5

10039013 has 2 divisors, whose sum is σ = 10039014. Its totient is φ = 10039012.

The previous prime is 10038991. The next prime is 10039031. The reversal of 10039013 is 31093001.

Together with next prime (10039031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9972964 + 66049 = 3158^2 + 257^2 .

It is an emirp because it is prime and its reverse (31093001) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10039013 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 210039013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10039013 is about 3168.4401525041. The cubic root of 10039013 is about 215.7232753171.

The spelling of 10039013 in words is "ten million, thirty-nine thousand, thirteen".