Search a number
-
+
110221102101 = 31122003151799
BaseRepresentation
bin110011010100110110…
…0001000110000010101
3101112111111110010102210
41212221230020300111
53301213100231401
6122345044424033
710651244623665
oct1465154106025
9345444403383
10110221102101
1142820a36420
12194409a8019
13a517262156
1454986da1a5
152d0171e4d6
hex19a9b08c15

110221102101 has 16 divisors (see below), whose sum is σ = 160329945600. Its totient is φ = 66797191920.

The previous prime is 110221102099. The next prime is 110221102133. The reversal of 110221102101 is 101201122011.

It is not a de Polignac number, because 110221102101 - 21 = 110221102099 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2110221102101 is an apocalyptic number.

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

It is an amenable number.

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

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

110221102101 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 173816.

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

Adding to 110221102101 its reverse (101201122011), we get a palindrome (211422224112).

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

Divisors: 1 3 11 33 22003 66009 151799 242033 455397 726099 1669789 5009367 3340033397 10020100191 36740367367 110221102101