Search a number
-
+
11051555351 = 251175325117
BaseRepresentation
bin10100100101011100…
…10101101000010111
31001112012110011212212
422102232111220113
5140113144232401
65024345104035
7540603445664
oct122256255027
931465404785
1011051555351
114761351121
12218518801b
131071808985
1476ba90a6b
1544a374dbb
hex292b95a17

11051555351 has 8 divisors (see below), whose sum is σ = 11102356944. Its totient is φ = 11000808000.

The previous prime is 11051555321. The next prime is 11051555357. The reversal of 11051555351 is 15355515011.

11051555351 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 a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11051555351 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 (11051555357) 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, 427445 + ... + 452561.

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

Almost surely, 211051555351 is an apocalyptic number.

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

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

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

The sum of its prime factors is 27121.

The product of its (nonzero) digits is 9375, while the sum is 32.

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

Divisors: 1 251 1753 25117 440003 6304367 44030101 11051555351