Search a number
-
+
61307513 is a prime number
BaseRepresentation
bin1110100111011…
…1101001111001
311021100202002122
43221313221321
5111143320023
610030011025
71343051051
oct351675171
9137322078
1061307513
1131674273
1218646a75
13c917147
1481dc561
1555b02c8
hex3a77a79

61307513 has 2 divisors, whose sum is σ = 61307514. Its totient is φ = 61307512.

The previous prime is 61307473. The next prime is 61307539. The reversal of 61307513 is 31570316.

It is a happy number.

It is an a-pointer prime, because the next prime (61307539) can be obtained adding 61307513 to its sum of digits (26).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 61277584 + 29929 = 7828^2 + 173^2 .

It is a cyclic number.

It is not a de Polignac number, because 61307513 - 210 = 61306489 is a prime.

It is a super-2 number, since 2×613075132 = 7517222300490338, which contains 22 as substring.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (61367513) 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, 30653756 + 30653757.

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

Almost surely, 261307513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1890, while the sum is 26.

The square root of 61307513 is about 7829.9114298950. The cubic root of 61307513 is about 394.3100984047.

Adding to 61307513 its reverse (31570316), we get a palindrome (92877829).

The spelling of 61307513 in words is "sixty-one million, three hundred seven thousand, five hundred thirteen".