Search a number
-
+
6550 = 252131
BaseRepresentation
bin1100110010110
322222121
41212112
5202200
650154
725045
oct14626
98877
106550
114a15
12395a
132c9b
14255c
151e1a
hex1996

6550 has 12 divisors (see below), whose sum is σ = 12276. Its totient is φ = 2600.

The previous prime is 6547. The next prime is 6551. The reversal of 6550 is 556.

Subtracting from 6550 its product of nonzero digits (150), we obtain a square (6400 = 802).

It is a happy number.

It is an Ulam number.

It is a plaindrome in base 14.

It is a nialpdrome in base 9 and base 10.

It is a zygodrome in base 9.

It is a congruent number.

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

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

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

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

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

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

The product of its (nonzero) digits is 150, while the sum is 16.

The square root of 6550 is about 80.9320702812. The cubic root of 6550 is about 18.7102863137.

The spelling of 6550 in words is "six thousand, five hundred fifty".

Divisors: 1 2 5 10 25 50 131 262 655 1310 3275 6550