Base | Representation |
---|---|
bin | 1011010100100001101101 |
3 | 12120202212101 |
4 | 23110201231 |
5 | 1224431121 |
6 | 143335101 |
7 | 34140034 |
oct | 13244155 |
9 | 5522771 |
10 | 2967661 |
11 | 1747714 |
12 | bb1491 |
13 | 7cba18 |
14 | 57371b |
15 | 3d9491 |
hex | 2d486d |
2967661 has 4 divisors (see below), whose sum is σ = 3063424. Its totient is φ = 2871900.
The previous prime is 2967649. The next prime is 2967689. The reversal of 2967661 is 1667692.
2967661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is not a de Polignac number, because 2967661 - 213 = 2959469 is a prime.
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 2967661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2967691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47835 + ... + 47896.
It is an arithmetic number, because the mean of its divisors is an integer number (765856).
22967661 is an apocalyptic number.
It is an amenable number.
2967661 is a deficient number, since it is larger than the sum of its proper divisors (95763).
2967661 is an equidigital number, since it uses as much as digits as its factorization.
2967661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95762.
The product of its digits is 27216, while the sum is 37.
The square root of 2967661 is about 1722.6900475709. The cubic root of 2967661 is about 143.7048513538.
The spelling of 2967661 in words is "two million, nine hundred sixty-seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •