Search a number
-
+
135939507481 is a prime number
BaseRepresentation
bin111111010011010100…
…0000100010100011001
3110222212212011111011101
41332212220010110121
54211401003214411
6142241051231401
712551464514461
oct1764650042431
9428785144141
10135939507481
1152719342aa8
1222419a48561
13ca855803bb
14681824cba1
1538094ec8c1
hex1fa6a04519

135939507481 has 2 divisors, whose sum is σ = 135939507482. Its totient is φ = 135939507480.

The previous prime is 135939507479. The next prime is 135939507503. The reversal of 135939507481 is 184705939531.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 133035267600 + 2904239881 = 364740^2 + 53891^2 .

It is a cyclic number.

It is not a de Polignac number, because 135939507481 - 21 = 135939507479 is a prime.

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

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

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

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

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

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

Almost surely, 2135939507481 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4082400, while the sum is 55.

The spelling of 135939507481 in words is "one hundred thirty-five billion, nine hundred thirty-nine million, five hundred seven thousand, four hundred eighty-one".