Search a number
-
+
134916260161 is a prime number
BaseRepresentation
bin111110110100110100…
…0101100000101000001
3110220020112202010201111
41331221220230011001
54202302030311121
6141551335403321
712514231201234
oct1755150540501
9426215663644
10134916260161
1152243791161
1222193223541
13c951593a07
14675c3ad41b
1537997782e1
hex1f69a2c141

134916260161 has 2 divisors, whose sum is σ = 134916260162. Its totient is φ = 134916260160.

The previous prime is 134916260159. The next prime is 134916260179. The reversal of 134916260161 is 161062619431.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 131800945936 + 3115314225 = 363044^2 + 55815^2 .

It is a cyclic number.

It is not a de Polignac number, because 134916260161 - 21 = 134916260159 is a prime.

It is a super-4 number, since 4×1349162601614 (a number of 46 digits) contains 4444 as substring.

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

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

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

Almost surely, 2134916260161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 46656, while the sum is 40.

Adding to 134916260161 its reverse (161062619431), we get a palindrome (295978879592).

The spelling of 134916260161 in words is "one hundred thirty-four billion, nine hundred sixteen million, two hundred sixty thousand, one hundred sixty-one".