Base | Representation |
---|---|
bin | 1100010010001… |
… | …10110010111001 |
3 | 21011220111121102 |
4 | 12021012302321 |
5 | 202340103200 |
6 | 14120421145 |
7 | 2360625362 |
oct | 611066271 |
9 | 234814542 |
10 | 103050425 |
11 | 53195345 |
12 | 2a6177b5 |
13 | 184710aa |
14 | d986b69 |
15 | 90a86d5 |
hex | 6246cb9 |
103050425 has 12 divisors (see below), whose sum is σ = 130900476. Its totient is φ = 80428800.
The previous prime is 103050407. The next prime is 103050443. The reversal of 103050425 is 524050301.
It is an interprime number because it is at equal distance from previous prime (103050407) and next prime (103050443).
It can be written as a sum of positive squares in 6 ways, for example, as 23001616 + 80048809 = 4796^2 + 8947^2 .
It is a de Polignac number, because none of the positive numbers 2k-103050425 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103050397 and 103050406.
It is an unprimeable number.
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, 49244 + ... + 51293.
It is an arithmetic number, because the mean of its divisors is an integer number (10908373).
Almost surely, 2103050425 is an apocalyptic number.
It is an amenable number.
103050425 is a deficient number, since it is larger than the sum of its proper divisors (27850051).
103050425 is a wasteful number, since it uses less digits than its factorization.
103050425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100588 (or 100583 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
The square root of 103050425 is about 10151.3755225585. The cubic root of 103050425 is about 468.8312973069.
The spelling of 103050425 in words is "one hundred three million, fifty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •