Search a number
BaseRepresentation
bin10000011011
31102221
4100123
513201
64511
73031
oct2033
91387
101051
11876
12737
1362b
14551
154a1
hex41b

1051 has 2 divisors, whose sum is σ = 1052. Its totient is φ = 1050.

The previous prime is 1049. The next prime is 1061. The reversal of 1051 is 1501.

1051 is nontrivially palindromic in base 12.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1051 - 21 = 1049 is a prime.

It is a super-2 number, since 2×10512 = 2209202, which contains 22 as substring.

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

1051 is an undulating number in base 12.

It is a nialpdrome in base 11 and base 14.

It is not a weakly prime, because it can be changed into another prime (1021) 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 as a sum of consecutive naturals, namely, 525 + 526.

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

1051 is the 21-st centered pentagonal number and also the 15-th centered decagonal number.

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

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

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

The product of its (nonzero) digits is 5, while the sum is 7.

The square root of 1051 is about 32.4191301549. The cubic root of 1051 is about 10.1671891995.

Adding to 1051 its reverse (1501), we get a palindrome (2552).

The spelling of 1051 in words is "one thousand, fifty-one".