Search a number
-
+
1365150601 is a prime number
BaseRepresentation
bin101000101011110…
…1000101110001001
310112010202211120101
41101113220232021
510243434304401
6343243525401
745554405623
oct12127505611
93463684511
101365150601
11640656941
12321229861
13189a99429
14cd43dc13
157ecae101
hex515e8b89

1365150601 has 2 divisors, whose sum is σ = 1365150602. Its totient is φ = 1365150600.

The previous prime is 1365150599. The next prime is 1365150613. The reversal of 1365150601 is 1060515631.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1124931600 + 240219001 = 33540^2 + 15499^2 .

It is a cyclic number.

It is not a de Polignac number, because 1365150601 - 21 = 1365150599 is a prime.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 1365150601.

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

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

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

Almost surely, 21365150601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 28.

The square root of 1365150601 is about 36947.9444759786. The cubic root of 1365150601 is about 1109.3285447515.

The spelling of 1365150601 in words is "one billion, three hundred sixty-five million, one hundred fifty thousand, six hundred one".