Search a number
-
+
135751094657 is a prime number
BaseRepresentation
bin111111001101101100…
…1010101000110000001
3110222101201122010100122
41332123121111012001
54211004240012112
6142210241030025
712544016160113
oct1763331250601
9428351563318
10135751094657
1152631a54722
1222386925315
13ca55522219
1467db2053b3
1537e7bd1872
hex1f9b655181

135751094657 has 2 divisors, whose sum is σ = 135751094658. Its totient is φ = 135751094656.

The previous prime is 135751094629. The next prime is 135751094659. The reversal of 135751094657 is 756490157531.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 126847096336 + 8903998321 = 356156^2 + 94361^2 .

It is a cyclic number.

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

Together with 135751094659, 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 = 135751094599 and 135751094608.

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

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

Almost surely, 2135751094657 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3969000, while the sum is 53.

The spelling of 135751094657 in words is "one hundred thirty-five billion, seven hundred fifty-one million, ninety-four thousand, six hundred fifty-seven".