Base | Representation |
---|---|
bin | 1010000000111101101001… |
… | …1100011000000000100110 |
3 | 1102222201000221101110220110 |
4 | 2200033122130120000212 |
5 | 2420403343002113420 |
6 | 35230404535313450 |
7 | 2214365231034204 |
oct | 240173234300046 |
9 | 42881027343813 |
10 | 11011666051110 |
11 | 356602645986a |
12 | 129a17481b886 |
13 | 61b51b33258a |
14 | 2a0d78aa4074 |
15 | 14168a961ee0 |
hex | a03da718026 |
11011666051110 has 32 divisors (see below), whose sum is σ = 27982586672352. Its totient is φ = 2763712263680.
The previous prime is 11011666051063. The next prime is 11011666051159. The reversal of 11011666051110 is 1115066611011.
It is a super-2 number, since 2×110116660511102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10795750521 + ... + 10795751540.
It is an arithmetic number, because the mean of its divisors is an integer number (874455833511).
Almost surely, 211011666051110 is an apocalyptic number.
11011666051110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011666051110 is an abundant number, since it is smaller than the sum of its proper divisors (16970920621242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011666051110 is a wasteful number, since it uses less digits than its factorization.
11011666051110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21591502088.
The product of its (nonzero) digits is 1080, while the sum is 30.
The spelling of 11011666051110 in words is "eleven trillion, eleven billion, six hundred sixty-six million, fifty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •