Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0111011111000011011111 |
3 | 1102222122121021012010001211 |
4 | 2200032321113133003133 |
5 | 2420401223421333434 |
6 | 35230233513245251 |
7 | 2214345412150414 |
oct | 240167127370337 |
9 | 42878537163054 |
10 | 11011111121119 |
11 | 356587119473a |
12 | 129a03aa03827 |
13 | 61b460387135 |
14 | 2a0d250d010b |
15 | 141656d98464 |
hex | a03b95df0df |
11011111121119 has 8 divisors (see below), whose sum is σ = 11198709027920. Its totient is φ = 10823741856000.
The previous prime is 11011111121093. The next prime is 11011111121141. The reversal of 11011111121119 is 91112111111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11011111121119 - 227 = 11010976903391 is a prime.
It is a super-2 number, since 2×110111111211192 (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 11011111121119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011111121189) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57063282 + ... + 57255919.
It is an arithmetic number, because the mean of its divisors is an integer number (1399838628490).
Almost surely, 211011111121119 is an apocalyptic number.
11011111121119 is a deficient number, since it is larger than the sum of its proper divisors (187597906801).
11011111121119 is a wasteful number, since it uses less digits than its factorization.
11011111121119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114320841.
The product of its (nonzero) digits is 18, while the sum is 22.
The spelling of 11011111121119 in words is "eleven trillion, eleven billion, one hundred eleven million, one hundred twenty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •