Search a number
-
+
10145577 = 313220011
BaseRepresentation
bin100110101100…
…111100101001
3201002110010010
4212230330221
510044124302
61001242133
7152143641
oct46547451
921073103
1010145577
1157aa582
123493349
132142c00
1414c1521
15d5616c
hex9acf29

10145577 has 12 divisors (see below), whose sum is σ = 14648784. Its totient is φ = 6243120.

The previous prime is 10145567. The next prime is 10145591. The reversal of 10145577 is 77554101.

It is not a de Polignac number, because 10145577 - 210 = 10144553 is a prime.

10145577 is a modest number, since divided by 5577 gives 1014 as remainder.

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

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

Almost surely, 210145577 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 10145577 is about 3185.2122378265. The cubic root of 10145577 is about 216.4838903007.

Adding to 10145577 its reverse (77554101), we get a palindrome (87699678).

The spelling of 10145577 in words is "ten million, one hundred forty-five thousand, five hundred seventy-seven".

Divisors: 1 3 13 39 169 507 20011 60033 260143 780429 3381859 10145577