Search a number
-
+
110102121111 = 3371019820901
BaseRepresentation
bin110011010001010011…
…0010000101010010111
3101112012012120021012110
41212202212100222113
53300442120333421
6122325154322103
710645301405433
oct1464246205227
9345165507173
10110102121111
114276a860224
1219408b89333
13a4c8703cb8
1454869a79c3
152ce606aa76
hex19a2990a97

110102121111 has 16 divisors (see below), whose sum is σ = 152263264608. Its totient is φ = 70710480000.

The previous prime is 110102121097. The next prime is 110102121131. The reversal of 110102121111 is 111121201011.

It is not a de Polignac number, because 110102121111 - 29 = 110102120599 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110102121131) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4899240 + ... + 4921661.

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

Almost surely, 2110102121111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9821042.

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

Adding to 110102121111 its reverse (111121201011), we get a palindrome (221223322122).

The spelling of 110102121111 in words is "one hundred ten billion, one hundred two million, one hundred twenty-one thousand, one hundred eleven".

Divisors: 1 3 37 101 111 303 3737 11211 9820901 29462703 363373337 991911001 1090120011 2975733003 36700707037 110102121111