Search a number
-
+
1064544062377 is a prime number
BaseRepresentation
bin11110111110110111100…
…01010100101110101001
310202202202220110111221211
433133123301110232221
5114420141234444002
62133013401433121
7136624252142005
oct17373361245651
93682686414854
101064544062377
1138051a409304
1215239579b7a1
1379503289123
143974a5d5705
151ca57dacdd7
hexf7dbc54ba9

1064544062377 has 2 divisors, whose sum is σ = 1064544062378. Its totient is φ = 1064544062376.

The previous prime is 1064544062311. The next prime is 1064544062399. The reversal of 1064544062377 is 7732604454601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 990540477081 + 74003585296 = 995259^2 + 272036^2 .

It is a cyclic number.

It is not a de Polignac number, because 1064544062377 - 239 = 514788248489 is a prime.

It is a super-2 number, since 2×10645440623772 (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 1064544062377.

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

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

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

Almost surely, 21064544062377 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3386880, while the sum is 49.

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