Base | Representation |
---|---|
bin | 110011010001100010… |
… | …1000101010100000101 |
3 | 101112012202202202212001 |
4 | 1212203011011110011 |
5 | 3301001202413333 |
6 | 122330043425301 |
7 | 10645430160304 |
oct | 1464305052405 |
9 | 345182682761 |
10 | 110110201093 |
11 | 427743798a2 |
12 | 1940b825231 |
13 | a4ca2a2959 |
14 | 5487aac43b |
15 | 2ce6b14b7d |
hex | 19a3145505 |
110110201093 has 4 divisors (see below), whose sum is σ = 112670903488. Its totient is φ = 107549498700.
The previous prime is 110110201073. The next prime is 110110201121. The reversal of 110110201093 is 390102011011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 390102011011 = 4261 ⋅91551751.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110110201093 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 110110201093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110201073) 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, 1280351133 + ... + 1280351218.
It is an arithmetic number, because the mean of its divisors is an integer number (28167725872).
Almost surely, 2110110201093 is an apocalyptic number.
It is an amenable number.
110110201093 is a deficient number, since it is larger than the sum of its proper divisors (2560702395).
110110201093 is an equidigital number, since it uses as much as digits as its factorization.
110110201093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2560702394.
The product of its (nonzero) digits is 54, while the sum is 19.
The spelling of 110110201093 in words is "one hundred ten billion, one hundred ten million, two hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •