Search a number
-
+
1102010112110 = 25791394949509
BaseRepresentation
bin10000000010010100111…
…010111101100001101110
310220100110222110001011102
4100002110322331201232
5121023404042041420
62202131221123102
7142421560253465
oct20022472754156
93810428401142
101102010112110
113953a5a84a76
121596b0b59492
137cbc438321b
143b4a24359dc
151d9ec1aea75
hex10094ebd86e

1102010112110 has 16 divisors (see below), whose sum is σ = 2008727294400. Its totient is φ = 435224246496.

The previous prime is 1102010112103. The next prime is 1102010112139. The reversal of 1102010112110 is 112110102011.

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

It is a congruent number.

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 7 ways as a sum of consecutive naturals, for example, 697473965 + ... + 697475544.

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

Almost surely, 21102010112110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1394949595.

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 1102010112110 its reverse (112110102011), we get a palindrome (1214120214121).

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

Divisors: 1 2 5 10 79 158 395 790 1394949509 2789899018 6974747545 13949495090 110201011211 220402022422 551005056055 1102010112110