Search a number
-
+
110011100111010 = 232575318129696131
BaseRepresentation
bin11001000000110111110100…
…100010110010000010100010
3112102111221212201100211211200
4121000313310202302002202
5103404410213112023020
61025550222433422030
732113016421066330
oct3100676442620242
9472457781324750
10110011100111010
113206449a03595a
1210408a7aa0a916
134950004b7ac97
141d247cc230b50
15cab993e79590
hex640df48b20a2

110011100111010 has 384 divisors, whose sum is σ = 335065403312640. Its totient is φ = 24522385305600.

The previous prime is 110011100110993. The next prime is 110011100111093. The reversal of 110011100111010 is 10111001110011.

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

It is a junction number, because it is equal to n+sod(n) for n = 110011100110983 and 110011100111001.

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 191 ways as a sum of consecutive naturals, for example, 17943415645 + ... + 17943421775.

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

Almost surely, 2110011100111010 is an apocalyptic number.

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

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

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

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

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

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

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

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

Adding to 110011100111010 its reverse (10111001110011), we get a palindrome (120122101221021).

Subtracting from 110011100111010 its reverse (10111001110011), we obtain a palindrome (99900099000999).

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