Search a number
-
+
11501153351 is a prime number
BaseRepresentation
bin10101011011000010…
…11010110001000111
31002200112110010101122
422231201122301013
5142023243401401
65141125344155
7555003122222
oct125541326107
932615403348
1011501153351
114972112816
12228b86805b
1311139c46ac
147b16865b9
15474a8421b
hex2ad85ac47

11501153351 has 2 divisors, whose sum is σ = 11501153352. Its totient is φ = 11501153350.

The previous prime is 11501153299. The next prime is 11501153399. The reversal of 11501153351 is 15335110511.

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

It is a strong prime.

It is a cyclic number.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11501123351) 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 as a sum of consecutive naturals, namely, 5750576675 + 5750576676.

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

Almost surely, 211501153351 is an apocalyptic number.

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

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

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

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

Adding to 11501153351 its reverse (15335110511), we get a palindrome (26836263862).

The spelling of 11501153351 in words is "eleven billion, five hundred one million, one hundred fifty-three thousand, three hundred fifty-one".