Search a number
-
+
85964583313369 is a prime number
BaseRepresentation
bin10011100010111100110000…
…011100111001111111011001
3102021101010121121122110222201
4103202330300130321333121
542231420431312011434
6502455330121050201
724051510340554415
oct2342746034717731
9367333547573881
1085964583313369
1125433414208742
129784619026961
1338c756b8667b7
1417329cababd45
159e1209483614
hex4e2f30739fd9

85964583313369 has 2 divisors, whose sum is σ = 85964583313370. Its totient is φ = 85964583313368.

The previous prime is 85964583313337. The next prime is 85964583313397. The reversal of 85964583313369 is 96331338546958.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 85942392742144 + 22190571225 = 9270512^2 + 148965^2 .

It is a cyclic number.

It is not a de Polignac number, because 85964583313369 - 25 = 85964583313337 is a prime.

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

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

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

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

Almost surely, 285964583313369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1511654400, while the sum is 73.

The spelling of 85964583313369 in words is "eighty-five trillion, nine hundred sixty-four billion, five hundred eighty-three million, three hundred thirteen thousand, three hundred sixty-nine".