Search a number
-
+
1110201011102 = 23117906467921
BaseRepresentation
bin10000001001111101001…
…000110000101110011110
310221010121211001211020202
4100021331020300232132
5121142142424323402
62210004100343502
7143131546614461
oct20117510605636
93833554054222
101110201011102
11398919589687
1215b1b80a4b92
13808cb315011
143ba3c1d32d8
151dd2b317b02
hex1027d230b9e

1110201011102 has 8 divisors (see below), whose sum is σ = 1719020920512. Its totient is φ = 537194037600.

The previous prime is 1110201011083. The next prime is 1110201011111. The reversal of 1110201011102 is 2011101020111.

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

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

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

Almost surely, 21110201011102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17906467954.

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

Adding to 1110201011102 its reverse (2011101020111), we get a palindrome (3121302031213).

Subtracting 1110201011102 from its reverse (2011101020111), we obtain a palindrome (900900009009).

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

Divisors: 1 2 31 62 17906467921 35812935842 555100505551 1110201011102