Search a number
-
+
10145132 = 2211092287
BaseRepresentation
bin100110101100…
…110101101100
3201002102111122
4212230311230
510044121012
61001240112
7152142434
oct46546554
921072448
1010145132
1157aa208
123493038
13214294a
1414c12c4
15d55e72
hex9acd6c

10145132 has 12 divisors (see below), whose sum is σ = 17777760. Its totient is φ = 5065776.

The previous prime is 10145129. The next prime is 10145137. The reversal of 10145132 is 23154101.

It is a self number, because there is not a number n which added to its sum of digits gives 10145132.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3293 + ... + 5579.

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

Almost surely, 210145132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 120, while the sum is 17.

The square root of 10145132 is about 3185.1423830027. The cubic root of 10145132 is about 216.4807251533.

Adding to 10145132 its reverse (23154101), we get a palindrome (33299233).

The spelling of 10145132 in words is "ten million, one hundred forty-five thousand, one hundred thirty-two".

Divisors: 1 2 4 1109 2218 2287 4436 4574 9148 2536283 5072566 10145132