Search a number
-
+
11025104151 = 331118549507
BaseRepresentation
bin10100100010010010…
…11011110100010111
31001110100200022122210
422101021123310113
5140034411313101
65022002124503
7540132560535
oct122111336427
931410608583
1011025104151
114748424a26
122178350733
1310691a7089
14768367155
15447d9c7d6
hex29125bd17

11025104151 has 8 divisors (see below), whose sum is σ = 15174337024. Its totient is φ = 7112970360.

The previous prime is 11025104143. The next prime is 11025104161. The reversal of 11025104151 is 15140152011.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 11025104151 - 23 = 11025104143 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 211025104151 is an apocalyptic number.

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

11025104151 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 118549541.

The product of its (nonzero) digits is 200, while the sum is 21.

Adding to 11025104151 its reverse (15140152011), we get a palindrome (26165256162).

The spelling of 11025104151 in words is "eleven billion, twenty-five million, one hundred four thousand, one hundred fifty-one".

Divisors: 1 3 31 93 118549507 355648521 3675034717 11025104151