Base | Representation |
---|---|
bin | 111111000100100110101 |
3 | 10220000000222 |
4 | 13320210311 |
5 | 1012113431 |
6 | 112144125 |
7 | 23365325 |
oct | 7704465 |
9 | 3800028 |
10 | 2066741 |
11 | 1191856 |
12 | 838045 |
13 | 574931 |
14 | 3bb285 |
15 | 2ac57b |
hex | 1f8935 |
2066741 has 8 divisors (see below), whose sum is σ = 2225304. Its totient is φ = 1912320.
The previous prime is 2066723. The next prime is 2066759. The reversal of 2066741 is 1476602.
It is an interprime number because it is at equal distance from previous prime (2066723) and next prime (2066759).
It can be written as a sum of positive squares in 4 ways, for example, as 255025 + 1811716 = 505^2 + 1346^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 2066741 - 210 = 2065717 is a prime.
It is a super-2 number, since 2×20667412 = 8542836722162, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2066741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2066761) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41 + ... + 2033.
It is an arithmetic number, because the mean of its divisors is an integer number (278163).
22066741 is an apocalyptic number.
It is an amenable number.
2066741 is a deficient number, since it is larger than the sum of its proper divisors (158563).
2066741 is a wasteful number, since it uses less digits than its factorization.
2066741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2071.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 2066741 is about 1437.6164300675. The cubic root of 2066741 is about 127.3782716185.
The spelling of 2066741 in words is "two million, sixty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •