Base | Representation |
---|---|
bin | 101100100000… |
… | …010100001101 |
3 | 210221201201001 |
4 | 230200110031 |
5 | 10441313301 |
6 | 1054020301 |
7 | 201110464 |
oct | 54402415 |
9 | 23851631 |
10 | 11666701 |
11 | 6649402 |
12 | 3aa7691 |
13 | 2556397 |
14 | 17999db |
15 | 1056c01 |
hex | b2050d |
11666701 has 2 divisors, whose sum is σ = 11666702. Its totient is φ = 11666700.
The previous prime is 11666693. The next prime is 11666737. The reversal of 11666701 is 10766611.
11666701 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6120676 + 5546025 = 2474^2 + 2355^2 .
It is an emirp because it is prime and its reverse (10766611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11666701 - 23 = 11666693 is a prime.
It is a super-2 number, since 2×116667012 = 272223824446802, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11666701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11666801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5833350 + 5833351.
It is an arithmetic number, because the mean of its divisors is an integer number (5833351).
Almost surely, 211666701 is an apocalyptic number.
It is an amenable number.
11666701 is a deficient number, since it is larger than the sum of its proper divisors (1).
11666701 is an equidigital number, since it uses as much as digits as its factorization.
11666701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 11666701 is about 3415.6552812015. The cubic root of 11666701 is about 226.8032930146.
The spelling of 11666701 in words is "eleven million, six hundred sixty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •