Base | Representation |
---|---|
bin | 1100010101111… |
… | …11100100100101 |
3 | 21012211122012122 |
4 | 12022333210211 |
5 | 203001421000 |
6 | 14135155325 |
7 | 2365055555 |
oct | 612774445 |
9 | 235748178 |
10 | 103545125 |
11 | 534a2a92 |
12 | 2a815b45 |
13 | 185b5308 |
14 | da75165 |
15 | 9155085 |
hex | 62bf925 |
103545125 has 8 divisors (see below), whose sum is σ = 129224472. Its totient is φ = 82836000.
The previous prime is 103545097. The next prime is 103545133. The reversal of 103545125 is 521545301.
It can be written as a sum of positive squares in 4 ways, for example, as 12952801 + 90592324 = 3599^2 + 9518^2 .
It is not a de Polignac number, because 103545125 - 26 = 103545061 is a prime.
It is a super-3 number, since 3×1035451253 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 103545094 and 103545103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 414056 + ... + 414305.
It is an arithmetic number, because the mean of its divisors is an integer number (16153059).
Almost surely, 2103545125 is an apocalyptic number.
It is an amenable number.
103545125 is a deficient number, since it is larger than the sum of its proper divisors (25679347).
103545125 is an frugal number, since it uses more digits than its factorization.
103545125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828376 (or 828366 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 103545125 is about 10175.7125057659. The cubic root of 103545125 is about 469.5803179816.
The spelling of 103545125 in words is "one hundred three million, five hundred forty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •