Search a number
-
+
1072340641 is a prime number
BaseRepresentation
bin111111111010101…
…001111010100001
32202201210112211001
4333322221322201
54144004400031
6254223552001
735400513361
oct7772517241
92681715731
101072340641
11500343439
1225b15b601
131412181b8
14a25bc9a1
1564220861
hex3fea9ea1

1072340641 has 2 divisors, whose sum is σ = 1072340642. Its totient is φ = 1072340640.

The previous prime is 1072340611. The next prime is 1072340669. The reversal of 1072340641 is 1460432701.

It is an a-pointer prime, because the next prime (1072340669) can be obtained adding 1072340641 to its sum of digits (28).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 685392400 + 386948241 = 26180^2 + 19671^2 .

It is a cyclic number.

It is not a de Polignac number, because 1072340641 - 27 = 1072340513 is a prime.

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

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

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

Almost surely, 21072340641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4032, while the sum is 28.

The square root of 1072340641 is about 32746.6126645184. The cubic root of 1072340641 is about 1023.5543820270.

The spelling of 1072340641 in words is "one billion, seventy-two million, three hundred forty thousand, six hundred forty-one".