15426640133 has 2 divisors, whose sum is σ = 15426640134. Its totient is φ = 15426640132.

The previous prime is 15426640127. The next prime is 15426640153. The reversal of 15426640133 is 33104662451.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 14716843969 + 709796164 = 121313^2 + 26642^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-15426640133 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 2^15426640133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 51840, while the sum is 35.

The spelling of 15426640133 in words is "fifteen billion, four hundred twenty-six million, six hundred forty thousand, one hundred thirty-three".