Search a number
-
+
1301515739 is a prime number
BaseRepresentation
bin100110110010011…
…1000110111011011
310100201000211221122
41031210320313123
510131142000424
6333051555455
744152462346
oct11544706733
93321024848
101301515739
11608743047
12303a5bb8b
13179848b74
14c4bd745d
15793de45e
hex4d938ddb

1301515739 has 2 divisors, whose sum is σ = 1301515740. Its totient is φ = 1301515738.

The previous prime is 1301515729. The next prime is 1301515741. The reversal of 1301515739 is 9375151031.

It is a strong prime.

It is an emirp because it is prime and its reverse (9375151031) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1301515739 - 28 = 1301515483 is a prime.

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

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 1301515699 and 1301515708.

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

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

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

Almost surely, 21301515739 is an apocalyptic number.

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

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

1301515739 is an evil number, because the sum of its binary digits is even.

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

The square root of 1301515739 is about 36076.5261492844. The cubic root of 1301515739 is about 1091.8168892767.

The spelling of 1301515739 in words is "one billion, three hundred one million, five hundred fifteen thousand, seven hundred thirty-nine".