Search a number
-
+
111001000000 = 26561110091
BaseRepresentation
bin110011101100000101…
…1001101100001000000
3101121111211222001020011
41213120023031201000
53304312224000000
6122554304354304
711006464634542
oct1473013154100
9347454861204
10111001000000
1143091197240
121961a015994
13a60c9c72b7
145530111692
152d49e252ba
hex19d82cd840

111001000000 has 196 divisors, whose sum is σ = 300390842448. Its totient is φ = 40360000000.

The previous prime is 111000999997. The next prime is 111001000001. The reversal of 111001000000 is 100111.

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

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

It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 10994955 + ... + 11005045.

Almost surely, 2111001000000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 111001000000 its reverse (100111), we get a palindrome (111001100111).

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