Search a number
-
+
65131519261 is a prime number
BaseRepresentation
bin111100101010001001…
…000001110100011101
320020010010102222211011
4330222021001310131
52031342132104021
645530534255221
74464006531154
oct745211016435
9206103388734
1065131519261
1125693054476
12107584b7511
1361ac916c13
14321c1cc59b
151a62ed7de1
hexf2a241d1d

65131519261 has 2 divisors, whose sum is σ = 65131519262. Its totient is φ = 65131519260.

The previous prime is 65131519207. The next prime is 65131519279. The reversal of 65131519261 is 16291513156.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 63136110361 + 1995408900 = 251269^2 + 44670^2 .

It is a cyclic number.

It is not a de Polignac number, because 65131519261 - 27 = 65131519133 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 265131519261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 48600, while the sum is 40.

The spelling of 65131519261 in words is "sixty-five billion, one hundred thirty-one million, five hundred nineteen thousand, two hundred sixty-one".