Base | Representation |
---|---|
bin | 1010001011000011001101 |
3 | 12000111000201 |
4 | 22023003031 |
5 | 1140313301 |
6 | 133053501 |
7 | 31444432 |
oct | 12130315 |
9 | 5014021 |
10 | 2666701 |
11 | 1561594 |
12 | a87291 |
13 | 724a3b |
14 | 4d5b89 |
15 | 37a201 |
hex | 28b0cd |
2666701 has 4 divisors (see below), whose sum is σ = 2738812. Its totient is φ = 2594592.
The previous prime is 2666693. The next prime is 2666717. The reversal of 2666701 is 1076662.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1076662 = 2 ⋅538331.
It can be written as a sum of positive squares in 2 ways, for example, as 2477476 + 189225 = 1574^2 + 435^2 .
It is a cyclic number.
It is not a de Polignac number, because 2666701 - 23 = 2666693 is a prime.
It is a super-2 number, since 2×26667012 = 14222588446802, which contains 22 as substring.
It is a Duffinian number.
2666701 is a lucky number.
It is a self number, because there is not a number n which added to its sum of digits gives 2666701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2666791) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36000 + ... + 36073.
It is an arithmetic number, because the mean of its divisors is an integer number (684703).
22666701 is an apocalyptic number.
It is an amenable number.
2666701 is a deficient number, since it is larger than the sum of its proper divisors (72111).
2666701 is an equidigital number, since it uses as much as digits as its factorization.
2666701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72110.
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 2666701 is about 1633.0036742151. The cubic root of 2666701 is about 138.6728500027.
The spelling of 2666701 in words is "two million, six hundred sixty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •