Search a number
-
+
60451616213 is a prime number
BaseRepresentation
bin111000010011001100…
…100111010111010101
312210000222101021201122
4320103030213113111
51442301103204323
643434315533325
74240022155022
oct702314472725
9183028337648
1060451616213
11237013a7aaa
12b87115a245
1359151a1711
142cd6852549
15188c20eec8
hexe133275d5

60451616213 has 2 divisors, whose sum is σ = 60451616214. Its totient is φ = 60451616212.

The previous prime is 60451616167. The next prime is 60451616221. The reversal of 60451616213 is 31261615406.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50723147524 + 9728468689 = 225218^2 + 98633^2 .

It is a cyclic number.

It is not a de Polignac number, because 60451616213 - 214 = 60451599829 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 260451616213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25920, while the sum is 35.

The spelling of 60451616213 in words is "sixty billion, four hundred fifty-one million, six hundred sixteen thousand, two hundred thirteen".