Search a number
-
+
1100110110010 = 25990111111101
BaseRepresentation
bin10000000000100011101…
…011000001110100111010
310220011120120020221021021
4100000203223001310322
5121011011142010020
62201214505333054
7142323516434662
oct20004353016472
93804516227237
101100110110010
113946105282aa
1215926079718a
137c98084b722
143b361d6b1a2
151d93a4a11aa
hex10023ac1d3a

1100110110010 has 16 divisors (see below), whose sum is σ = 1980398376072. Its totient is φ = 439999560000.

The previous prime is 1100110109971. The next prime is 1100110110031. The reversal of 1100110110010 is 100110110011.

It is a happy number.

It can be written as a sum of positive squares in 4 ways, for example, as 1066244173281 + 33865936729 = 1032591^2 + 184027^2 .

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

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5456541 + ... + 5654560.

Almost surely, 21100110110010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 11121009.

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

Adding to 1100110110010 its reverse (100110110011), we get a palindrome (1200220220021).

Subtracting from 1100110110010 its reverse (100110110011), we obtain a palindrome (999999999999).

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

Divisors: 1 2 5 10 9901 19802 49505 99010 11111101 22222202 55555505 111111010 110011011001 220022022002 550055055005 1100110110010