Search a number
-
+
136324356115681 is a prime number
BaseRepresentation
bin11110111111110001111100…
…110100100000110011100001
3122212200110222202210201222201
4132333301330310200303201
5120332014240131200211
61201534313350133201
740500052425544036
oct3677617464406341
9585613882721881
10136324356115681
113a4899200710a8
12133586a7051201
135b0b440757946
1425941c3b4938d
1510b61990c70c1
hex7bfc7cd20ce1

136324356115681 has 2 divisors, whose sum is σ = 136324356115682. Its totient is φ = 136324356115680.

The previous prime is 136324356115621. The next prime is 136324356115723. The reversal of 136324356115681 is 186511653423631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100659082410000 + 35665273705681 = 10032900^2 + 5972041^2 .

It is a cyclic number.

It is not a de Polignac number, because 136324356115681 - 237 = 136186917162209 is a prime.

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

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

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

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

Almost surely, 2136324356115681 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 136324356115681 in words is "one hundred thirty-six trillion, three hundred twenty-four billion, three hundred fifty-six million, one hundred fifteen thousand, six hundred eighty-one".