Base | Representation |
---|---|
bin | 1100010110000… |
… | …00110111011001 |
3 | 21012211220110221 |
4 | 12023000313121 |
5 | 203002103200 |
6 | 14135240041 |
7 | 2365110166 |
oct | 613006731 |
9 | 235756427 |
10 | 103550425 |
11 | 534a6a70 |
12 | 2a819021 |
13 | 185b7854 |
14 | da7706d |
15 | 915691a |
hex | 62c0dd9 |
103550425 has 12 divisors (see below), whose sum is σ = 140075856. Its totient is φ = 75309200.
The previous prime is 103550411. The next prime is 103550429. The reversal of 103550425 is 524055301.
It is not a de Polignac number, because 103550425 - 215 = 103517657 is a prime.
It is a super-3 number, since 3×1035504253 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103550425.
It is not an unprimeable number, because it can be changed into a prime (103550429) 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, 187999 + ... + 188548.
It is an arithmetic number, because the mean of its divisors is an integer number (11672988).
Almost surely, 2103550425 is an apocalyptic number.
It is an amenable number.
103550425 is a deficient number, since it is larger than the sum of its proper divisors (36525431).
103550425 is a wasteful number, since it uses less digits than its factorization.
103550425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376568 (or 376563 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 25.
The square root of 103550425 is about 10175.9729264577. The cubic root of 103550425 is about 469.5883297324.
The spelling of 103550425 in words is "one hundred three million, five hundred fifty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •