Search a number
-
+
1066515143 is a prime number
BaseRepresentation
bin111111100100011…
…011101011000111
32202022211120201212
4333210123223013
54141011441033
6253455042035
735300141411
oct7744335307
92668746655
101066515143
114a8024681
1225921031b
1313cc58765
14a19039b1
156396e748
hex3f91bac7

1066515143 has 2 divisors, whose sum is σ = 1066515144. Its totient is φ = 1066515142.

The previous prime is 1066515137. The next prime is 1066515157. The reversal of 1066515143 is 3415156601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1066515143 - 24 = 1066515127 is a prime.

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

It is a Sophie Germain prime.

It is a congruent number.

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

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

Almost surely, 21066515143 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 32.

The square root of 1066515143 is about 32657.5434318015. The cubic root of 1066515143 is about 1021.6975267274.

The spelling of 1066515143 in words is "one billion, sixty-six million, five hundred fifteen thousand, one hundred forty-three".