Search a number
-
+
10131152 = 24633197
BaseRepresentation
bin100110101001…
…011011010000
3201001201022212
4212221123100
510043144102
61001051252
7152053613
oct46513320
921051285
1010131152
11579a759
123486b28
132139485
1414ba17a
15d51c52
hex9a96d0

10131152 has 10 divisors (see below), whose sum is σ = 19629138. Its totient is φ = 5065568.

The previous prime is 10131151. The next prime is 10131157. The reversal of 10131152 is 25113101.

It can be written as a sum of positive squares in only one way, i.e., 6948496 + 3182656 = 2636^2 + 1784^2 .

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 316583 + ... + 316614.

Almost surely, 210131152 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 30, while the sum is 14.

The square root of 10131152 is about 3182.9470620794. The cubic root of 10131152 is about 216.3812425729.

Adding to 10131152 its reverse (25113101), we get a palindrome (35244253).

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

Divisors: 1 2 4 8 16 633197 1266394 2532788 5065576 10131152