2601 has 9 divisors (see below), whose sum is σ = 3991. Its totient is φ = 1632.

The previous prime is 2593. The next prime is 2609. The reversal of 2601 is 1062.

2601 = T_{50} + T_{51}.

The square root of 2601 is 51.

It is a perfect power (a square), and thus also a powerful number.

It is an interprime number because it is at equal distance from previous prime (2593) and next prime (2609).

It can be written as a sum of positive squares in only one way, i.e., 2025 + 576 = 45^2 + 24^2 .

It is a tau number, because it is divible by the number of its divisors (9).

It is not a de Polignac number, because 2601 - 2^{3} = 2593 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a nialpdrome in base 15.

It is an inconsummate number, since it does not exist a number *n* which divided by its sum of digits gives 2601.

It is not an unprimeable number, because it can be changed into a prime (2609) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (5) of ones.

It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 145 + ... + 161.

2601 is the 51-st square number.

2601 is the 26-th centered octagonal number.

It is an amenable number.

2601 is a deficient number, since it is larger than the sum of its proper divisors (1390).

2601 is a wasteful number, since it uses less digits than its factorization.

With its predecessor (2600) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (20).

2601 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 40 (or 20 counting only the distinct ones).

The product of its (nonzero) digits is 12, while the sum is 9.

The cubic root of 2601 is about 13.7524513536.

Adding to 2601 its reverse (1062), we get a palindrome (3663).

The spelling of 2601 in words is "two thousand, six hundred one".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •