Search a number
-
+
110110110010 = 2511011011001
BaseRepresentation
bin110011010001100010…
…0101111000100111010
3101112012202121010220121
41212203010233010322
53301001142010020
6122330041443454
710645426330615
oct1464304570472
9345182533817
10110110110010
114277431741a
121940b7a058a
13a4ca270364
145487a8717c
152ce6ae7baa
hex19a312f13a

110110110010 has 8 divisors (see below), whose sum is σ = 198198198036. Its totient is φ = 44044044000.

The previous prime is 110110110007. The next prime is 110110110037. The reversal of 110110110010 is 10011011011.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 107006840161 + 3103269849 = 327119^2 + 55707^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5505505491 + ... + 5505505510.

Almost surely, 2110110110010 is an apocalyptic number.

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

110110110010 is a deficient number, since it is larger than the sum of its proper divisors (88088088026).

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

110110110010 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 11011011008.

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

Adding to 110110110010 its reverse (10011011011), we get a palindrome (120121121021).

It can be divided in two parts, 1101101 and 10010, that added together give a palindrome (1111111).

The spelling of 110110110010 in words is "one hundred ten billion, one hundred ten million, one hundred ten thousand, ten".

Divisors: 1 2 5 10 11011011001 22022022002 55055055005 110110110010