Search a number
-
+
85914560741 is a prime number
BaseRepresentation
bin101000000000011101…
…0000010100011100101
322012202112101220001012
41100000322002203211
52401423111420431
6103245115112005
76131020500632
oct1200072024345
9265675356035
1085914560741
1133488591109
1214798742605
1381425b77b9
1442304a7189
15237c87b22b
hex1400e828e5

85914560741 has 2 divisors, whose sum is σ = 85914560742. Its totient is φ = 85914560740.

The previous prime is 85914560729. The next prime is 85914560749. The reversal of 85914560741 is 14706541958.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 84174836641 + 1739724100 = 290129^2 + 41710^2 .

It is a cyclic number.

It is not a de Polignac number, because 85914560741 - 214 = 85914544357 is a prime.

It is a super-4 number, since 4×859145607414 (a number of 45 digits) contains 4444 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 285914560741 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1209600, while the sum is 50.

The spelling of 85914560741 in words is "eighty-five billion, nine hundred fourteen million, five hundred sixty thousand, seven hundred forty-one".