Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …1100111100011111110111 |
3 | 1110022100012200112001210011 |
4 | 2201203202330330133313 |
5 | 2423343400244320434 |
6 | 35340105000241051 |
7 | 2224043662330222 |
oct | 241434274743767 |
9 | 43270180461704 |
10 | 11102003120119 |
11 | 35a037337288a |
12 | 12b3786470187 |
13 | 626bb6c31072 |
14 | 2a54a86645b9 |
15 | 143bc66c0e64 |
hex | a18e2f3c7f7 |
11102003120119 has 4 divisors (see below), whose sum is σ = 11103954611680. Its totient is φ = 11100051628560.
The previous prime is 11102003120107. The next prime is 11102003120137. The reversal of 11102003120119 is 91102130020111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11102003120119 - 217 = 11102002989047 is a prime.
It is a super-2 number, since 2×111020031201192 (a number of 27 digits) contains 22 as substring.
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 11102003120119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102003120149) 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, 975737247 + ... + 975748624.
It is an arithmetic number, because the mean of its divisors is an integer number (2775988652920).
Almost surely, 211102003120119 is an apocalyptic number.
11102003120119 is a deficient number, since it is larger than the sum of its proper divisors (1951491561).
11102003120119 is an equidigital number, since it uses as much as digits as its factorization.
11102003120119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1951491560.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 11102003120119 in words is "eleven trillion, one hundred two billion, three million, one hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •