Search a number
-
+
110110111100010 = 23257367106949801
BaseRepresentation
bin11001000010010100000010…
…000011101110110001101010
3112102212102102222000020001100
4121002110002003232301222
5103413021001420200020
61030103515310502230
732123123125443000
oct3102240203566152
9472772388006040
10110110111100010
11320a248817339a
12104240b1504976
1349594537ca2c8
141d29501ba4a70
15cae33b453a90
hex6425020eec6a

110110111100010 has 384 divisors, whose sum is σ = 339168353472000. Its totient is φ = 24768693734400.

The previous prime is 110110111099999. The next prime is 110110111100021. The reversal of 110110111100010 is 10001111011011.

It is an interprime number because it is at equal distance from previous prime (110110111099999) and next prime (110110111100021).

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

It is a Curzon number.

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

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, 2210977110 + ... + 2211026910.

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

Almost surely, 2110110111100010 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110110111100010 its reverse (10001111011011), we get a palindrome (120111222111021).

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