1050 has 24 divisors (see below), whose sum is σ = 2976. Its totient is φ = 240.
The previous prime is 1049. The next prime is 1051. The reversal of 1050 is 501.
It is an interprime number because it is at equal distance from previous prime (1049) and next prime (1051).
Together with 1925 it forms a betrothed pair.
It is a super-2 number, since 2×10502 = 2205000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an alternating number because its digits alternate between odd and even.
1050 is an undulating number in base 7.
It is a nialpdrome in base 11 and base 14.
It is not an unprimeable number, because it can be changed into a prime (1051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 147 + ... + 153.
It is an arithmetic number, because the mean of its divisors is an integer number (124).
1050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1488).
1050 is an abundant number, since it is smaller than the sum of its proper divisors (1926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050 is a wasteful number, since it uses less digits than its factorization.
1050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22 (or 17 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 6.
The square root of 1050 is about 32.4037034920. The cubic root of 1050 is about 10.1639635681.
Adding to 1050 its reverse (501), we get a palindrome (1551).
The spelling of 1050 in words is "one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •