Search a number
-
+
1361514701 is a prime number
BaseRepresentation
bin101000100100111…
…0001000011001101
310111212221010001102
41101021301003031
510242021432301
6343033552445
745511453421
oct12111610315
93455833042
101361514701
116395a3168
1231bb75725
131890c5501
14ccb74b81
157e7e1b6b
hex512710cd

1361514701 has 2 divisors, whose sum is σ = 1361514702. Its totient is φ = 1361514700.

The previous prime is 1361514629. The next prime is 1361514703. The reversal of 1361514701 is 1074151631.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1269853225 + 91661476 = 35635^2 + 9574^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1361514701 is a prime.

Together with 1361514703, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 21361514701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 29.

The square root of 1361514701 is about 36898.7086630413. The cubic root of 1361514701 is about 1108.3428186398.

The spelling of 1361514701 in words is "one billion, three hundred sixty-one million, five hundred fourteen thousand, seven hundred one".