Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0010110111011011111 |
3 | 101112012202102010020101 |
4 | 1212203010112323133 |
5 | 3301001130323403 |
6 | 122330035401531 |
7 | 10645425436351 |
oct | 1464304267337 |
9 | 345182363211 |
10 | 110110011103 |
11 | 4277425a084 |
12 | 1940b7532a7 |
13 | a4ca237331 |
14 | 5487a5d0d1 |
15 | 2ce6ac871d |
hex | 19a3116edf |
110110011103 has 4 divisors (see below), whose sum is σ = 110142088528. Its totient is φ = 110077933680.
The previous prime is 110110011083. The next prime is 110110011127. The reversal of 110110011103 is 301110011011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301110011011 = 1447 ⋅208092613.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110110011103 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110110011103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110011163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16033563 + ... + 16040428.
It is an arithmetic number, because the mean of its divisors is an integer number (27535522132).
Almost surely, 2110110011103 is an apocalyptic number.
110110011103 is a deficient number, since it is larger than the sum of its proper divisors (32077425).
110110011103 is an equidigital number, since it uses as much as digits as its factorization.
110110011103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32077424.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 110110011103 its reverse (301110011011), we get a palindrome (411220022114).
The spelling of 110110011103 in words is "one hundred ten billion, one hundred ten million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •