Search a number
-
+
1375015755181 is a prime number
BaseRepresentation
bin10100000000100101010…
…100110101110110101101
311212110011012201122201011
4110000211110311312231
5140012013013131211
62531401251345221
7201225113035105
oct24004524656655
94773135648634
101375015755181
11490160602382
121a25a1bb2211
139c881728963
144a7a03a4205
1525b79a50921
hex14025535dad

1375015755181 has 2 divisors, whose sum is σ = 1375015755182. Its totient is φ = 1375015755180.

The previous prime is 1375015755167. The next prime is 1375015755193. The reversal of 1375015755181 is 1815575105731.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 962037297225 + 412978457956 = 980835^2 + 642634^2 .

It is a cyclic number.

It is not a de Polignac number, because 1375015755181 - 219 = 1375015230893 is a prime.

It is a super-2 number, since 2×13750157551812 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 21375015755181 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 735000, while the sum is 49.

The spelling of 1375015755181 in words is "one trillion, three hundred seventy-five billion, fifteen million, seven hundred fifty-five thousand, one hundred eighty-one".