Search a number
BaseRepresentation
bin10110101011
31222202
4112223
521301
610415
74142
oct2653
91882
101451
1110aa
12a0b
13878
14759
1566b
hex5ab

1451 has 2 divisors, whose sum is σ = 1452. Its totient is φ = 1450.

The previous prime is 1447. The next prime is 1453. The reversal of 1451 is 1541.

1451 is nontrivially palindromic in base 13.

1451 is an esthetic number in base 13, because in such base its adjacent digits differ by 1.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1451 - 22 = 1447 is a prime.

It is a Sophie Germain prime.

Together with 1453, it forms a pair of twin primes.

It is a Chen prime.

1451 is an undulating number in base 13.

It is a plaindrome in base 4, base 15 and base 16.

It is not a weakly prime, because it can be changed into another prime (1453) 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, 725 + 726.

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

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

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

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

The product of its digits is 20, while the sum is 11.

The square root of 1451 is about 38.0919939095. The cubic root of 1451 is about 11.3211133185.

Subtracting from 1451 its product of digits (20), we obtain a triangular number (1431 = T53).

Adding to 1451 its reverse (1541), we get a palindrome (2992).

The spelling of 1451 in words is "one thousand, four hundred fifty-one".