Search a number
-
+
11050505051 = 192356324683
BaseRepresentation
bin10100100101010100…
…10101001101011011
31001112010110211010212
422102222111031123
5140112412130201
65024310401335
7540561512615
oct122252251533
931463424125
1011050505051
1147607a4003
12218496024b
13107152b8b1
1476b899db5
1544a218abb
hex292a9535b

11050505051 has 8 divisors (see below), whose sum is σ = 11633075520. Its totient is φ = 10468031112.

The previous prime is 11050505047. The next prime is 11050505057. The reversal of 11050505051 is 15050505011.

It is a happy number.

11050505051 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 not a de Polignac number, because 11050505051 - 22 = 11050505047 is a prime.

It is a super-2 number, since 2×110505050512 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (11050505057) 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, 435356 + ... + 460038.

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

Almost surely, 211050505051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 48265.

The product of its (nonzero) digits is 625, while the sum is 23.

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

Divisors: 1 19 23563 24683 447697 468977 581605529 11050505051