14536326105061 has 2 divisors, whose sum is σ = 14536326105062. Its totient is φ = 14536326105060.

The previous prime is 14536326105001. The next prime is 14536326105113. The reversal of 14536326105061 is 16050162363541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14525862860961 + 10463244100 = 3811281^2 + 102290^2 .

It is a cyclic number.

It is not a de Polignac number, because 14536326105061 - 2⁴³ = 5740233082853 is a prime.

It is a super-2 number, since 2×14536326105061² (a number of 27 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

Almost surely, 2^{14536326105061} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 388800, while the sum is 43.

The spelling of 14536326105061 in words is "fourteen trillion, five hundred thirty-six billion, three hundred twenty-six million, one hundred five thousand, sixty-one".