Search a number
-
+
1150 = 25223
BaseRepresentation
bin10001111110
31120121
4101332
514100
65154
73232
oct2176
91517
101150
11956
127ba
136a6
145c2
1551a
hex47e

1150 has 12 divisors (see below), whose sum is σ = 2232. Its totient is φ = 440.

The previous prime is 1129. The next prime is 1151. The reversal of 1150 is 511.

Adding to 1150 its reverse (511), we get a palindrome (1661).

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

1150 is nontrivially palindromic in base 13.

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

1150 is an undulating number in base 7 and base 13.

It is a plaindrome in base 16.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1151) by changing a digit.

1150 is an untouchable number, because it is not equal to the sum of proper divisors of any number.

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 in 5 ways as a sum of consecutive naturals, for example, 39 + ... + 61.

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

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

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

1150 is a wasteful number, since it uses less digits than its factorization.

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

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

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

The square root of 1150 is about 33.9116499156. The cubic root of 1150 is about 10.4768955317.

The spelling of 1150 in words is "one thousand, one hundred fifty".

Divisors: 1 2 5 10 23 25 46 50 115 230 575 1150