Search a number
BaseRepresentation
bin1010101110001
321112022
41111301
5133424
641225
722001
oct12561
97468
105489
114140
123215
132663
142001
15195e
hex1571

5489 has 4 divisors (see below), whose sum is σ = 6000. Its totient is φ = 4980.

The previous prime is 5483. The next prime is 5501. The reversal of 5489 is 9845.

Subtracting 5489 from its reverse (9845), we obtain a square (4356 = 662).

It can be divided in two parts, 5 and 489, that added together give a palindrome (494).

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 5489 - 28 = 5233 is a prime.

It is an Ulam number.

It is a cake number, because a cake can be divided into 5489 parts by 32 planar cuts.

It is a Duffinian number.

It is a Curzon number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 5489.

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

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 3 ways as a sum of consecutive naturals, for example, 239 + ... + 260.

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

25489 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 510.

The product of its digits is 1440, while the sum is 26.

The square root of 5489 is about 74.0877857680. The cubic root of 5489 is about 17.6399659949.

The spelling of 5489 in words is "five thousand, four hundred eighty-nine".

Divisors: 1 11 499 5489