Search a number
-
+
135748657153 is a prime number
BaseRepresentation
bin111111001101101000…
…0000010000000000001
3110222101120001021201201
41332123100002000001
54211003124012103
6142210112501201
712543656355514
oct1763320020001
9428346037651
10135748657153
115263063a35a
1222385b4a801
13ca54b7a905
1467dab6cd7b
1537e789e51d
hex1f9b402001

135748657153 has 2 divisors, whose sum is σ = 135748657154. Its totient is φ = 135748657152.

The previous prime is 135748657151. The next prime is 135748657217. The reversal of 135748657153 is 351756847531.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 132315517504 + 3433139649 = 363752^2 + 58593^2 .

It is a cyclic number.

It is not a de Polignac number, because 135748657153 - 21 = 135748657151 is a prime.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2135748657153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 10584000, while the sum is 55.

The spelling of 135748657153 in words is "one hundred thirty-five billion, seven hundred forty-eight million, six hundred fifty-seven thousand, one hundred fifty-three".