Search a number
BaseRepresentation
bin10111100000
32001201
4113200
522004
610544
74246
oct2740
92051
101504
111148
12a54
138b9
14796
156a4
hex5e0

1504 has 12 divisors (see below), whose sum is σ = 3024. Its totient is φ = 736.

The previous prime is 1499. The next prime is 1511. The reversal of 1504 is 4051.

Adding to 1504 its reverse (4051), we get a palindrome (5555).

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

It is a plaindrome in base 11.

It is a nialpdrome in base 12.

It is a congruent number.

It is an unprimeable number.

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, 9 + ... + 55.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1512).

1504 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 20, while the sum is 10.

The square root of 1504 is about 38.7814388593. The cubic root of 1504 is about 11.4573086320.

The spelling of 1504 in words is "one thousand, five hundred four".

Divisors: 1 2 4 8 16 32 47 94 188 376 752 1504