Search a number
-
+
1011111110001 = 32179627629491
BaseRepresentation
bin11101011011010101110…
…10110010010101110001
310120122212001221021222200
432231222322302111301
5113031223421010001
62052255324053413
7133023163425516
oct16555272622561
93518761837880
101011111110001
1135a89a953333
12143b63094269
1374469226845
1436d1bd9b30d
151b47be52086
hexeb6aeb2571

1011111110001 has 12 divisors (see below), whose sum is σ = 1468653011280. Its totient is φ = 670308295320.

The previous prime is 1011111109997. The next prime is 1011111110011. The reversal of 1011111110001 is 1000111111101.

It is not a de Polignac number, because 1011111110001 - 22 = 1011111109997 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 313813135 + ... + 313816356.

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

Almost surely, 21011111110001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1, while the sum is 9.

Adding to 1011111110001 its reverse (1000111111101), we get a palindrome (2011222221102).

The spelling of 1011111110001 in words is "one trillion, eleven billion, one hundred eleven million, one hundred ten thousand, one".

Divisors: 1 3 9 179 537 1611 627629491 1882888473 5648665419 112345678889 337037036667 1011111110001