Search a number
-
+
111110000001000 = 2335371113173759997
BaseRepresentation
bin11001010000110111010000…
…000101001011111111101000
3112120102000022221101020100020
4121100313100011023333220
5104030411240000013000
61032151121312040440
732255301244042140
oct3120672005137750
9476360287336306
10111110000001000
1132448539406a20
1210565a42233120
1349cc821a67490
141d61a7756b920
15cca35d071ba0
hex650dd014bfe8

111110000001000 has 4096 divisors, whose sum is σ = 515244080332800. Its totient is φ = 19166035968000.

The previous prime is 111110000000999. The next prime is 111110000001023. The reversal of 111110000001000 is 100000011111.

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 self number, because there is not a number n which added to its sum of digits gives 111110000001000.

It is an unprimeable number.

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 1023 ways as a sum of consecutive naturals, for example, 111444332502 + ... + 111444333498.

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

Almost surely, 2111110000001000 is an apocalyptic number.

111110000001000 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 111110000001000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (257622040166400).

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

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

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

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

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

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

Adding to 111110000001000 its reverse (100000011111), we get a palindrome (111210000012111).

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