Search a number
-
+
1111110000000 = 273577111337
BaseRepresentation
bin10000001010110011010…
…100010001110110000000
310221012222011111020121020
4100022303110101312000
5121201023130000000
62210234211225440
7143163225112050
oct20126324216600
93835864436536
101111110000000
113992456a0480
1215b4105a8280
1380a14737c80
143bac6c0d560
151dd8101cba0
hex102b3511d80

1111110000000 has 2048 divisors, whose sum is σ = 5087236976640. Its totient is φ = 207360000000.

The previous prime is 1111109999933. The next prime is 1111110000001. The reversal of 1111110000000 is 111111.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a nialpdrome in base 10.

It is a zygodrome in base 10.

It is a congruent number.

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

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 30029999982 + ... + 30030000018.

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

Almost surely, 21111110000000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

1111110000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 1111110000000 its reverse (111111), we get a palindrome (1111110111111).

1111110000000 divided by its reverse (111111) gives a 7-th power (10000000 = 107).

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

The spelling of 1111110000000 in words is "one trillion, one hundred eleven billion, one hundred ten million", and thus it is an aban number.