Search a number
-
+
1027075069 is a prime number
BaseRepresentation
bin111101001101111…
…110101111111101
32122120121211010101
4331031332233331
54100412400234
6245525441101
734310664646
oct7515765775
92576554111
101027075069
11487836779
12247b70191
13134a29a37
149a5986cd
156027d814
hex3d37ebfd

1027075069 has 2 divisors, whose sum is σ = 1027075070. Its totient is φ = 1027075068.

The previous prime is 1027075061. The next prime is 1027075099. The reversal of 1027075069 is 9605707201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 716258169 + 310816900 = 26763^2 + 17630^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1027075069 - 23 = 1027075061 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21027075069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1027075069 is about 32048.0119352199. The cubic root of 1027075069 is about 1008.9447754382.

The spelling of 1027075069 in words is "one billion, twenty-seven million, seventy-five thousand, sixty-nine".