15106525561 has 4 divisors (see below), whose sum is σ = 15193846692. Its totient is φ = 15019204432.

The previous prime is 15106525549. The next prime is 15106525619. The reversal of 15106525561 is 16552560151.

15106525561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16552560151 = 131 ⋅126355421.

It can be written as a sum of positive squares in 2 ways, for example, as 13953515625 + 1153009936 = 118125^2 + 33956^2 .

It is a cyclic number.

It is not a de Polignac number, because 15106525561 - 2¹⁷ = 15106394489 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 15106525561.

It is not an unprimeable number, because it can be changed into a prime (15106525061) 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 in 3 ways as a sum of consecutive naturals, for example, 43660306 + ... + 43660651.

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

Almost surely, 2^15106525561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 87321130.

The product of its (nonzero) digits is 45000, while the sum is 37.

The spelling of 15106525561 in words is "fifteen billion, one hundred six million, five hundred twenty-five thousand, five hundred sixty-one".