1053 has 10 divisors (see below), whose sum is σ = 1694. Its totient is φ = 648.

The previous prime is 1051. The next prime is 1061. The reversal of 1053 is 3501.

Adding to 1053 its reverse (3501), we get a palindrome (4554).

1053 is nontrivially palindromic in base 11.

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

It can be written as a sum of positive squares in only one way, i.e., 729 + 324 = 27^2 + 18^2 .

It is not a de Polignac number, because 1053 - 2^{1} = 1051 is a prime.

It is a super-2 number, since 2×1053^{2} = 2217618, which contains 22 as substring.

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

It is an iccanobiF number.

It is a Duffinian number.

1053 is an undulating number in base 11.

1053 is a lucky number.

It is a nialpdrome in base 3, base 13 and base 14.

It is a zygodrome in base 3.

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 1053.

It is not an unprimeable number, because it can be changed into a prime (1051) 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 9 ways as a sum of consecutive naturals, for example, 75 + ... + 87.

1053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The square root of 1053 is about 32.4499614792. The cubic root of 1053 is about 10.1736343290.

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

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