Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1101000110000100110101 |
3 | 1102222112201220111020212121 |
4 | 2200031313031012010311 |
5 | 2420341440240213414 |
6 | 35225531421515541 |
7 | 2214306043142443 |
oct | 240156715060465 |
9 | 42875656436777 |
10 | 11010001101109 |
11 | 356535165622a |
12 | 129998b112bb1 |
13 | 61b31440876a |
14 | 2a0c5b903b93 |
15 | 1415de6d3724 |
hex | a0377346135 |
11010001101109 has 4 divisors (see below), whose sum is σ = 11017815155820. Its totient is φ = 11002187046400.
The previous prime is 11010001101091. The next prime is 11010001101139. The reversal of 11010001101109 is 90110110001011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 264041822500 + 10745959278609 = 513850^2 + 3278103^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010001101109 - 29 = 11010001100597 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010001101092 and 11010001101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010001101139) 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, 3907025242 + ... + 3907028059.
It is an arithmetic number, because the mean of its divisors is an integer number (2754453788955).
Almost surely, 211010001101109 is an apocalyptic number.
It is an amenable number.
11010001101109 is a deficient number, since it is larger than the sum of its proper divisors (7814054711).
11010001101109 is an equidigital number, since it uses as much as digits as its factorization.
11010001101109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7814054710.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 11010001101109 in words is "eleven trillion, ten billion, one million, one hundred one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •