Search a number
-
+
1375555001 is a prime number
BaseRepresentation
bin101000111111101…
…0100110110111001
310112212100102201112
41101333110312321
510304120230001
6344254530105
746042011302
oct12177246671
93485312645
101375555001
11646512917
12324806935
1318bca0092
14d098b7a9
1580b66cbb
hex51fd4db9

1375555001 has 2 divisors, whose sum is σ = 1375555002. Its totient is φ = 1375555000.

The previous prime is 1375554937. The next prime is 1375555007. The reversal of 1375555001 is 1005555731.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 689115001 + 686440000 = 26251^2 + 26200^2 .

It is a cyclic number.

It is not a de Polignac number, because 1375555001 - 26 = 1375554937 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 21375555001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13125, while the sum is 32.

The square root of 1375555001 is about 37088.4753124202. The cubic root of 1375555001 is about 1112.1396386350.

The spelling of 1375555001 in words is "one billion, three hundred seventy-five million, five hundred fifty-five thousand, one".