Search a number
-
+
1064210543527 is a prime number
BaseRepresentation
bin11110111110001111110…
…01000011001110100111
310202201220122220000002211
433133013321003032213
5114414000344343102
62132520325144251
7136613062236565
oct17370771031647
93681818800084
101064210543527
1138036912069a
12152301b5b087
137947c1537b1
14397181b8a35
151ca3897c7d7
hexf7c7e433a7

1064210543527 has 2 divisors, whose sum is σ = 1064210543528. Its totient is φ = 1064210543526.

The previous prime is 1064210543471. The next prime is 1064210543537. The reversal of 1064210543527 is 7253450124601.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1064210543527 - 223 = 1064202154919 is a prime.

It is a super-2 number, since 2×10642105435272 (a number of 25 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 1064210543527.

It is a congruent number.

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

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

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

Almost surely, 21064210543527 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 201600, while the sum is 40.

The spelling of 1064210543527 in words is "one trillion, sixty-four billion, two hundred ten million, five hundred forty-three thousand, five hundred twenty-seven".