Base | Representation |
---|---|
bin | 10101101110110010… |
… | …01000011111101001 |
3 | 1010010002001111002222 |
4 | 22313121020133221 |
5 | 142343142103023 |
6 | 5205403003425 |
7 | 562053524432 |
oct | 126731103751 |
9 | 33102044088 |
10 | 11666753513 |
11 | 4a4763a658 |
12 | 2317209575 |
13 | 113c0c615c |
14 | 7c9672489 |
15 | 484395cc8 |
hex | 2b76487e9 |
11666753513 has 4 divisors (see below), whose sum is σ = 11666994768. Its totient is φ = 11666512260.
The previous prime is 11666753471. The next prime is 11666753533. The reversal of 11666753513 is 31535766611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31535766611 = 199 ⋅158471189.
It is a cyclic number.
It is not a de Polignac number, because 11666753513 - 220 = 11665704937 is a prime.
It is a super-2 number, since 2×116667535132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11666753533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20243 + ... + 154088.
It is an arithmetic number, because the mean of its divisors is an integer number (2916748692).
Almost surely, 211666753513 is an apocalyptic number.
It is an amenable number.
11666753513 is a deficient number, since it is larger than the sum of its proper divisors (241255).
11666753513 is an equidigital number, since it uses as much as digits as its factorization.
11666753513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241254.
The product of its digits is 340200, while the sum is 44.
The spelling of 11666753513 in words is "eleven billion, six hundred sixty-six million, seven hundred fifty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •