Search a number
-
+
1072665637 is a prime number
BaseRepresentation
bin111111111011111…
…001010000100101
32202202102001121221
4333323321100211
54144100300022
6254234540341
735403336031
oct7773712045
92682361557
101072665637
1150054562a
1225b2976b1
131413000c4
14a26651c1
1564286cc7
hex3fef9425

1072665637 has 2 divisors, whose sum is σ = 1072665638. Its totient is φ = 1072665636.

The previous prime is 1072665619. The next prime is 1072665679. The reversal of 1072665637 is 7365662701.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1072628001 + 37636 = 32751^2 + 194^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×10726656372 = 2301223137601231538, which contains 22 as substring.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21072665637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 317520, while the sum is 43.

The square root of 1072665637 is about 32751.5745728354. The cubic root of 1072665637 is about 1023.6577750059.

The spelling of 1072665637 in words is "one billion, seventy-two million, six hundred sixty-five thousand, six hundred thirty-seven".