Search a number
-
+
11111011012 = 222777752753
BaseRepresentation
bin10100101100100010…
…01001001011000100
31001200100022211201101
422112101021023010
5140223404323022
65034311305444
7542225015053
oct122621111304
931610284641
1011111011012
114791970032
1221a107b284
131080c24c3a
1477592a39a
154506bb627
hex2964492c4

11111011012 has 6 divisors (see below), whose sum is σ = 19444269278. Its totient is φ = 5555505504.

The previous prime is 11111010997. The next prime is 11111011061. The reversal of 11111011012 is 21011011111.

It can be written as a sum of positive squares in only one way, i.e., 10246298176 + 864712836 = 101224^2 + 29406^2 .

It is a self number, because there is not a number n which added to its sum of digits gives 11111011012.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1388876373 + ... + 1388876380.

Almost surely, 211111011012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 11111011012 its reverse (21011011111), we get a palindrome (32122022123).

Subtracting 11111011012 from its reverse (21011011111), we obtain a palindrome (9900000099).

The spelling of 11111011012 in words is "eleven billion, one hundred eleven million, eleven thousand, twelve".

Divisors: 1 2 4 2777752753 5555505506 11111011012