Search a number
-
+
10125561 = 331108877
BaseRepresentation
bin100110101000…
…000011111001
3201001102122210
4212220003321
510043004221
61001005333
7152031405
oct46500371
921042583
1010125561
115796536
123483849
132136a74
1414b8105
15d50276
hex9a80f9

10125561 has 8 divisors (see below), whose sum is σ = 13936384. Its totient is φ = 6532560.

The previous prime is 10125551. The next prime is 10125569. The reversal of 10125561 is 16552101.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10125561 - 27 = 10125433 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

Almost surely, 210125561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 108911.

The product of its (nonzero) digits is 300, while the sum is 21.

The square root of 10125561 is about 3182.0686667638. The cubic root of 10125561 is about 216.3414310378.

Adding to 10125561 its reverse (16552101), we get a palindrome (26677662).

The spelling of 10125561 in words is "ten million, one hundred twenty-five thousand, five hundred sixty-one".

Divisors: 1 3 31 93 108877 326631 3375187 10125561