761 has 2 divisors, whose sum is σ = 762. Its totient is φ = 760.

The previous prime is 757. The next prime is 769. The reversal of 761 is 167.

It is a happy number.

761 is nontrivially palindromic in base 12.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 400 + 361 = 20^2 + 19^2 .

It is an emirp because it is prime and its reverse (167) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 761 - 2^{2} = 757 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is an alternating number because its digits alternate between odd and even.

761 is an undulating number in base 12.

It is a Curzon number.

It is a plaindrome in base 13 and base 15.

It is a nialpdrome in base 10 and base 11.

It is a congruent number.

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

It is not a weakly prime, because it can be changed into another prime (769) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 380 + 381.

It is an arithmetic number, because the mean of its divisors is an integer number (381).

761 is the 20-th centered square number.

It is an amenable number.

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

761 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its digits is 42, while the sum is 14.

The square root of 761 is about 27.5862284483. The cubic root of 761 is about 9.1298060627.

Subtracting from 761 its sum of digits (14), we obtain a palindrome (747).

It can be divided in two parts, 76 and 1, that added together give a palindrome (77).

The spelling of 761 in words is "seven hundred sixty-one", and thus it is an aban number.

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