Base | Representation |
---|---|
bin | 1100010010110… |
… | …01000101010001 |
3 | 21012001022100122 |
4 | 12021121011101 |
5 | 202400002304 |
6 | 14122200025 |
7 | 2361356636 |
oct | 611310521 |
9 | 235038318 |
10 | 103125329 |
11 | 5323664a |
12 | 2a653015 |
13 | 18499208 |
14 | d9a618d |
15 | 90c09be |
hex | 6259151 |
103125329 has 2 divisors, whose sum is σ = 103125330. Its totient is φ = 103125328.
The previous prime is 103125317. The next prime is 103125371. The reversal of 103125329 is 923521301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102921025 + 204304 = 10145^2 + 452^2 .
It is an emirp because it is prime and its reverse (923521301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103125329 - 216 = 103059793 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 103125298 and 103125307.
It is not a weakly prime, because it can be changed into another prime (103125229) 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 as a sum of consecutive naturals, namely, 51562664 + 51562665.
It is an arithmetic number, because the mean of its divisors is an integer number (51562665).
Almost surely, 2103125329 is an apocalyptic number.
It is an amenable number.
103125329 is a deficient number, since it is larger than the sum of its proper divisors (1).
103125329 is an equidigital number, since it uses as much as digits as its factorization.
103125329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 103125329 is about 10155.0642046222. The cubic root of 103125329 is about 468.9448625327.
The spelling of 103125329 in words is "one hundred three million, one hundred twenty-five thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •