Search a number
BaseRepresentation
bin100111111000
310111112
4213320
540202
615452
710304
oct4770
93445
102552
111a10
121588
131214
14d04
15b52
hex9f8

2552 has 16 divisors (see below), whose sum is σ = 5400. Its totient is φ = 1120.

The previous prime is 2551. The next prime is 2557.

2552 is nontrivially palindromic in base 10.

It is an Ulam number.

It is a plaindrome in base 9 and base 12.

It is a nialpdrome in base 15.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (2551) 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, 74 + ... + 102.

22552 is an apocalyptic number.

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

It is an amenable number.

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

2552 is an abundant number, since it is smaller than the sum of its proper divisors (2848).

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

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

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

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

The product of its digits is 100, while the sum is 14.

The square root of 2552 is about 50.5173237613. The cubic root of 2552 is about 13.6655429045.

It can be divided in two parts, 25 and 52, that added together give a palindrome (77).

The spelling of 2552 in words is "two thousand, five hundred fifty-two".

Divisors: 1 2 4 8 11 22 29 44 58 88 116 232 319 638 1276 2552