Search a number
-
+
1040867137 is a prime number
BaseRepresentation
bin111110000010100…
…101111101000001
32200112120112021201
4332002211331001
54112430222022
6251141221201
734536140032
oct7602457501
92615515251
101040867137
114945a6982
12250701801
1313784861b
149c348a89
15615a5127
hex3e0a5f41

1040867137 has 2 divisors, whose sum is σ = 1040867138. Its totient is φ = 1040867136.

The previous prime is 1040867117. The next prime is 1040867173. The reversal of 1040867137 is 7317680401.

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

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 887503681 + 153363456 = 29791^2 + 12384^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 21040867137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1040867137 is about 32262.4725803835. The cubic root of 1040867137 is about 1013.4409114950.

The spelling of 1040867137 in words is "one billion, forty million, eight hundred sixty-seven thousand, one hundred thirty-seven".