Search a number
BaseRepresentation
bin11001001101000001…
…01110011111101111
31021220222222210022022
430212200232133233
5210202414441101
610114400340355
7656211505523
oct144640563757
937828883268
1013531015151
1158139a5a55
1227576146bb
1313783c5b54
149250b5d83
15542d94a1b
hex32682e7ef

13531015151 has 2 divisors, whose sum is σ = 13531015152. Its totient is φ = 13531015150.

The previous prime is 13531015111. The next prime is 13531015159. The reversal of 13531015151 is 15151013531.

It is a strong prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 213531015151 is an apocalyptic number.

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

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

13531015151 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1125, while the sum is 26.

Adding to 13531015151 its reverse (15151013531), we get a palindrome (28682028682).

The spelling of 13531015151 in words is "thirteen billion, five hundred thirty-one million, fifteen thousand, one hundred fifty-one".