Search a number
BaseRepresentation
bin11001010000111000001011…
…101011111000011000000000
3112120102002220122001110002020
4121100320023223320120000
5104030420312000000000
61032151404433321440
732255335105640130
oct3120701353703000
9476362818043066
10111111000000000
1132448a01929a80
1210566081106280
1349cc950ca4070
141d61b302b8ac0
15cca3bac52ba0
hex650e0baf8600

111111000000000 has 3200 divisors, whose sum is σ = 510221197753344. Its totient is φ = 20736000000000.

The previous prime is 111110999999977. The next prime is 111111000000031. The reversal of 111111000000000 is 111111.

Adding to 111111000000000 its reverse (111111), we get a palindrome (111111000111111).

111111000000000 divided by its reverse (111111) gives a 9-th power (1000000000 = 109).

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

It is a tau number, because it is divible by the number of its divisors (3200).

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 an unprimeable number.

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

It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 3002999999982 + ... + 3003000000018.

Almost surely, 2111111000000000 is an apocalyptic number.

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

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

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

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

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

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

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

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