Search a number
-
+
1060136425 = 52223190159
BaseRepresentation
bin111111001100000…
…110010111101001
32201212211111210001
4333030012113221
54132343331200
6253110223001
735162003515
oct7714062751
92655744701
101060136425
114a4468207
12257054a61
1313b83427a
14a0b23145
156310e76a
hex3f3065e9

1060136425 has 12 divisors (see below), whose sum is σ = 1320471040. Its totient is φ = 844301520.

The previous prime is 1060136417. The next prime is 1060136477. The reversal of 1060136425 is 5246310601.

It is not a de Polignac number, because 1060136425 - 23 = 1060136417 is a prime.

It is a super-2 number, since 2×10601364252 = 2247778479223561250, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 1060136393 and 1060136402.

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 89505 + ... + 100654.

Almost surely, 21060136425 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 4320, while the sum is 28.

The square root of 1060136425 is about 32559.7362550743. The cubic root of 1060136425 is about 1019.6565628977.

The spelling of 1060136425 in words is "one billion, sixty million, one hundred thirty-six thousand, four hundred twenty-five".

Divisors: 1 5 25 223 1115 5575 190159 950795 4753975 42405457 212027285 1060136425