Search a number
-
+
1039319137 is a prime number
BaseRepresentation
bin111101111100101…
…100000001100001
32200102122212211101
4331330230001201
54112031203022
6251044114401
734520031643
oct7574540141
92612585741
101039319137
1149373993a
12250095a01
13137425b4c
149c064893
156139b627
hex3df2c061

1039319137 has 2 divisors, whose sum is σ = 1039319138. Its totient is φ = 1039319136.

The previous prime is 1039319107. The next prime is 1039319143. The reversal of 1039319137 is 7319139301.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 957036096 + 82283041 = 30936^2 + 9071^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 21039319137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15309, while the sum is 37.

The square root of 1039319137 is about 32238.4729321970. The cubic root of 1039319137 is about 1012.9382585180.

The spelling of 1039319137 in words is "one billion, thirty-nine million, three hundred nineteen thousand, one hundred thirty-seven".