Search a number
-
+
111010011110100 = 22325273109122912613
BaseRepresentation
bin11001001111011010001000…
…010001110101101011010100
3112120001110020112122021220200
4121033122020101311223110
5104022242000321010400
61032033143423100500
732245131363352524
oct3117321021655324
9476043215567820
10111010011110100
113240a0992792a3
121054a598141730
1349c327864738b
141d5acadb9d684
15cc7959ccdb00
hex64f688475ad4

111010011110100 has 432 divisors, whose sum is σ = 356275065946800. Its totient is φ = 28903459184640.

The previous prime is 111010011110087. The next prime is 111010011110147. The reversal of 111010011110100 is 1011110010111.

111010011110100 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 24 ways, for example, as 25105030082064 + 85904981028036 = 5010492^2 + 9268494^2 .

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

It is a congruent number.

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 143 ways as a sum of consecutive naturals, for example, 8801231394 + ... + 8801244006.

Almost surely, 2111010011110100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 111010011110100 its reverse (1011110010111), we get a palindrome (112021121120211).

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