Search a number
-
+
11050100051012 = 2211659381090497
BaseRepresentation
bin1010000011001100110101…
…0010011100110001000100
31110010101020110201222010022
42200303031102130301010
52422021101103113022
635300202413314312
72220225531453101
oct240631522346104
943111213658108
1011050100051012
113580359448850
1212a5700195998
13622034b24859
142a2b832abaa8
15142689c13c42
hexa0ccd49cc44

11050100051012 has 24 divisors (see below), whose sum is σ = 21127657209120. Its totient is φ = 5015150927360.

The previous prime is 11050100050879. The next prime is 11050100051017. The reversal of 11050100051012 is 21015000105011.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 190516253 + ... + 190574244.

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

Almost surely, 211050100051012 is an apocalyptic number.

It is an amenable number.

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

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

11050100051012 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 381091171 (or 381091169 counting only the distinct ones).

The product of its (nonzero) digits is 50, while the sum is 17.

Adding to 11050100051012 its reverse (21015000105011), we get a palindrome (32065100156023).

The spelling of 11050100051012 in words is "eleven trillion, fifty billion, one hundred million, fifty-one thousand, twelve".

Divisors: 1 2 4 11 22 44 659 1318 2636 7249 14498 28996 381090497 762180994 1524361988 4191995467 8383990934 16767981868 251138637523 502277275046 1004554550092 2762525012753 5525050025506 11050100051012