Search a number
-
+
110011101110002 = 2192895028976579
BaseRepresentation
bin11001000000110111110100…
…100110100101111011110010
3112102111221212210020121012101
4121000313310212211323302
5103404410213341010002
61025550222511051014
732113016432430001
oct3100676446457362
9472457783217171
10110011101110002
113206449a658474
1210408a7b210a6a
13495000513a8c1
141d247cc410c38
15cab9940c5587
hex640df49a5ef2

110011101110002 has 8 divisors (see below), whose sum is σ = 173701738594800. Its totient is φ = 52110521578404.

The previous prime is 110011101109993. The next prime is 110011101110011. The reversal of 110011101110002 is 200011101110011.

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

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

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, 1447514488252 + ... + 1447514488327.

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

Almost surely, 2110011101110002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2895028976600.

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

Adding to 110011101110002 its reverse (200011101110011), we get a palindrome (310022202220013).

Subtracting 110011101110002 from its reverse (200011101110011), we obtain a palindrome (90000000000009).

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

Divisors: 1 2 19 38 2895028976579 5790057953158 55005550555001 110011101110002