Base | Representation |
---|---|
bin | 1010100111000011110100… |
… | …0011101111000000110001 |
3 | 1112022021101102212122102122 |
4 | 2221300331003233000301 |
5 | 3012114241311040410 |
6 | 40451205145124025 |
7 | 2312565132103106 |
oct | 251607503570061 |
9 | 45267342778378 |
10 | 11666155565105 |
11 | 3798652753758 |
12 | 1384b8ba89615 |
13 | 668162ba4452 |
14 | 2c4905a14aad |
15 | 1536e4390e55 |
hex | a9c3d0ef031 |
11666155565105 has 8 divisors (see below), whose sum is σ = 14002614600552. Its totient is φ = 9330772503808.
The previous prime is 11666155565081. The next prime is 11666155565147. The reversal of 11666155565105 is 50156555166611.
It can be written as a sum of positive squares in 4 ways, for example, as 876008018209 + 10790147546896 = 935953^2 + 3284836^2 .
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 11666155565105 - 210 = 11666155564081 is a prime.
It is a super-2 number, since 2×116661555651052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 268969682 + ... + 269013051.
It is an arithmetic number, because the mean of its divisors is an integer number (1750326825069).
Almost surely, 211666155565105 is an apocalyptic number.
It is an amenable number.
11666155565105 is a deficient number, since it is larger than the sum of its proper divisors (2336459035447).
11666155565105 is an equidigital number, since it uses as much as digits as its factorization.
11666155565105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537987075.
The product of its (nonzero) digits is 4050000, while the sum is 53.
The spelling of 11666155565105 in words is "eleven trillion, six hundred sixty-six billion, one hundred fifty-five million, five hundred sixty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •