Search a number
-
+
1011010001111 = 1110129009901
BaseRepresentation
bin11101011011001001110…
…01000101100011010111
310120122121000200102122222
432231210321011203113
5113031022030013421
62052241313012555
7133020525134435
oct16554471054327
93518530612588
101011010001111
1135a848874770
12143b3525415b
13744512b53b6
1436d0c79bd55
151b47312dcab
hexeb64e458d7

1011010001111 has 12 divisors (see below), whose sum is σ = 1113948243672. Its totient is φ = 909999900000.

The previous prime is 1011010001083. The next prime is 1011010001173. The reversal of 1011010001111 is 1111000101101.

It is a de Polignac number, because none of the positive numbers 2k-1011010001111 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21011010001111 is an apocalyptic number.

1011010001111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

1011010001111 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 1011010001111 its reverse (1111000101101), we get a palindrome (2122010102212).

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

Divisors: 1 11 101 1111 10201 112211 9009901 99108911 910000001 10010000011 91910000101 1011010001111