Base | Representation |
---|---|
bin | 1010001001101110001101 |
3 | 12000012120020 |
4 | 22021232031 |
5 | 1140130021 |
6 | 133012353 |
7 | 31422531 |
oct | 12115615 |
9 | 5005506 |
10 | 2661261 |
11 | 1558499 |
12 | a840b9 |
13 | 722415 |
14 | 4d3bc1 |
15 | 3787c6 |
hex | 289b8d |
2661261 has 8 divisors (see below), whose sum is σ = 3702720. Its totient is φ = 1696992.
The previous prime is 2661251. The next prime is 2661271. The reversal of 2661261 is 1621662.
2661261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2661251) and next prime (2661271).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2661261 - 210 = 2660237 is a prime.
It is a super-2 number, since 2×26612612 = 14164620220242, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2661221) 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 7 ways as a sum of consecutive naturals, for example, 19216 + ... + 19353.
It is an arithmetic number, because the mean of its divisors is an integer number (462840).
22661261 is an apocalyptic number.
It is an amenable number.
2661261 is a deficient number, since it is larger than the sum of its proper divisors (1041459).
2661261 is a wasteful number, since it uses less digits than its factorization.
2661261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38595.
The product of its digits is 864, while the sum is 24.
The square root of 2661261 is about 1631.3371815784. The cubic root of 2661261 is about 138.5784894853.
The spelling of 2661261 in words is "two million, six hundred sixty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •