Search a number
-
+
1100110110002 = 2603791113973
BaseRepresentation
bin10000000000100011101…
…011000001110100110010
310220011120120020221020222
4100000203223001310302
5121011011142010002
62201214505333042
7142323516434651
oct20004353016462
93804516227228
101100110110002
113946105282a2
12159260797182
137c98084b717
143b361d6b198
151d93a4a11a2
hex10023ac1d32

1100110110002 has 8 divisors (see below), whose sum is σ = 1650438525036. Its totient is φ = 549963934992.

The previous prime is 1100110109971. The next prime is 1100110110031. The reversal of 1100110110002 is 2000110110011.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 947447210161 + 152662899841 = 973369^2 + 390721^2 .

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

It is a super-2 number, since 2×11001101100022 (a number of 25 digits) contains 22 as substring.

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, 45544913 + ... + 45569060.

Almost surely, 21100110110002 is an apocalyptic number.

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

1100110110002 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 91120012.

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 1100110110002 its reverse (2000110110011), we get a palindrome (3100220220013).

Subtracting 1100110110002 from its reverse (2000110110011), we obtain a palindrome (900000000009).

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

Divisors: 1 2 6037 12074 91113973 182227946 550055055001 1100110110002