Search a number
-
+
11155551041 = 110571008913
BaseRepresentation
bin10100110001110110…
…00011001101000001
31001210110010201011002
422120323003031001
5140321310113131
65042542101345
7543305422265
oct123073031501
931713121132
1011155551041
114805021678
1221b3b7a855
13108a21b09b
1477b8020a5
154545686cb
hex298ec3341

11155551041 has 4 divisors (see below), whose sum is σ = 11156571012. Its totient is φ = 11154531072.

The previous prime is 11155551031. The next prime is 11155551151. The reversal of 11155551041 is 14015555111.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 2972539441 + 8183011600 = 54521^2 + 90460^2 .

It is a cyclic number.

It is not a de Polignac number, because 11155551041 - 226 = 11088442177 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11155550995 and 11155551013.

It is not an unprimeable number, because it can be changed into a prime (11155551031) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 493400 + ... + 515513.

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

Almost surely, 211155551041 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1019970.

The product of its (nonzero) digits is 2500, while the sum is 29.

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

Divisors: 1 11057 1008913 11155551041