Base | Representation |
---|---|
bin | 1010000111010011101100… |
… | …0101001111111100111111 |
3 | 1110101010101000200002002201 |
4 | 2201310323011033330333 |
5 | 2424200103324424101 |
6 | 35352432243332331 |
7 | 2225304234423412 |
oct | 241647305177477 |
9 | 43333330602081 |
10 | 11120661561151 |
11 | 35a827859978a |
12 | 12b73130810a7 |
13 | 62889b6ac70c |
14 | 2a63586cbb79 |
15 | 14441978ce01 |
hex | a1d3b14ff3f |
11120661561151 has 8 divisors (see below), whose sum is σ = 11192062354704. Its totient is φ = 11049267964800.
The previous prime is 11120661561133. The next prime is 11120661561179. The reversal of 11120661561151 is 15116516602111.
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 11120661561151 - 217 = 11120661430079 is a prime.
It is a super-2 number, since 2×111206615611512 (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 11120661561151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120661561101) 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, 1318176 + ... + 4896826.
It is an arithmetic number, because the mean of its divisors is an integer number (1399007794338).
Almost surely, 211120661561151 is an apocalyptic number.
11120661561151 is a deficient number, since it is larger than the sum of its proper divisors (71400793553).
11120661561151 is a wasteful number, since it uses less digits than its factorization.
11120661561151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3598601.
The product of its (nonzero) digits is 10800, while the sum is 37.
The spelling of 11120661561151 in words is "eleven trillion, one hundred twenty billion, six hundred sixty-one million, five hundred sixty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •