Base | Representation |
---|---|
bin | 1100010100000… |
… | …10011001111101 |
3 | 21012100220112112 |
4 | 12022002121331 |
5 | 202420411324 |
6 | 14125543405 |
7 | 2362663256 |
oct | 612023175 |
9 | 235326475 |
10 | 103294589 |
11 | 53341832 |
12 | 2a714b65 |
13 | 18528278 |
14 | da0bb2d |
15 | 9105c0e |
hex | 628267d |
103294589 has 2 divisors, whose sum is σ = 103294590. Its totient is φ = 103294588.
The previous prime is 103294559. The next prime is 103294603. The reversal of 103294589 is 985492301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102353689 + 940900 = 10117^2 + 970^2 .
It is an emirp because it is prime and its reverse (985492301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103294589 - 220 = 102246013 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103294559) 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 as a sum of consecutive naturals, namely, 51647294 + 51647295.
It is an arithmetic number, because the mean of its divisors is an integer number (51647295).
Almost surely, 2103294589 is an apocalyptic number.
It is an amenable number.
103294589 is a deficient number, since it is larger than the sum of its proper divisors (1).
103294589 is an equidigital number, since it uses as much as digits as its factorization.
103294589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 41.
The square root of 103294589 is about 10163.3945608738. The cubic root of 103294589 is about 469.2012826329.
The spelling of 103294589 in words is "one hundred three million, two hundred ninety-four thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •