Search a number
BaseRepresentation
bin10011110010100
3111220021
42132110
5311012
6114524
741353
oct23624
914807
1010132
117681
125a44
1347c5
14399a
153007
hex2794

10132 has 12 divisors (see below), whose sum is σ = 18900. Its totient is φ = 4736.

The previous prime is 10111. The next prime is 10133. The reversal of 10132 is 23101.

Adding to 10132 its reverse (23101), we get a palindrome (33233).

10132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 4356 + 5776 = 66^2 + 76^2 .

It is an Ulam number.

It is a plaindrome in base 14.

It is a congruent number.

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

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

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

210132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 10132 is about 100.6578362573. The cubic root of 10132 is about 21.6387279602.

The spelling of 10132 in words is "ten thousand, one hundred thirty-two".

Divisors: 1 2 4 17 34 68 149 298 596 2533 5066 10132