Search a number
-
+
1110000001110 = 23571113193752579
BaseRepresentation
bin10000001001110001001…
…001111110000001010110
310221010002210211110101020
4100021301021332001112
5121141240000013420
62205532120142010
7143123556222510
oct20116111760126
93833083743336
101110000001110
11398826076920
1215b160907906
13808987960b0
143ba1d62abb0
151dd1885e340
hex1027127e056

1110000001110 has 512 divisors, whose sum is σ = 3866926694400. Its totient is φ = 196246333440.

The previous prime is 1110000001063. The next prime is 1110000001111. The reversal of 1110000001110 is 111000000111.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1110000001111) 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 255 ways as a sum of consecutive naturals, for example, 21084801 + ... + 21137379.

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

Almost surely, 21110000001110 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 1110000001110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1933463347200).

1110000001110 is an abundant number, since it is smaller than the sum of its proper divisors (2756926693290).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 52676.

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

Adding to 1110000001110 its reverse (111000000111), we get a palindrome (1221000001221).

Subtracting from 1110000001110 its reverse (111000000111), we obtain a palindrome (999000000999).

It can be divided in two parts, 1110000001 and 110, that added together give a palindrome (1110000111).

The spelling of 1110000001110 in words is "one trillion, one hundred ten billion, one thousand, one hundred ten".