Base | Representation |
---|---|
bin | 1100011010000… |
… | …11000010001101 |
3 | 21020211222212001 |
4 | 12031003002031 |
5 | 203121133342 |
6 | 14154512301 |
7 | 2402460502 |
oct | 615030215 |
9 | 236758761 |
10 | 104083597 |
11 | 53830602 |
12 | 2aa35691 |
13 | 18743437 |
14 | db754a9 |
15 | 920e8b7 |
hex | 634308d |
104083597 has 2 divisors, whose sum is σ = 104083598. Its totient is φ = 104083596.
The previous prime is 104083589. The next prime is 104083643. The reversal of 104083597 is 795380401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77105961 + 26977636 = 8781^2 + 5194^2 .
It is an emirp because it is prime and its reverse (795380401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104083597 - 23 = 104083589 is a prime.
It is a Chen prime.
It is equal to p5983048 and since 104083597 and 5983048 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104081597) 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, 52041798 + 52041799.
It is an arithmetic number, because the mean of its divisors is an integer number (52041799).
Almost surely, 2104083597 is an apocalyptic number.
It is an amenable number.
104083597 is a deficient number, since it is larger than the sum of its proper divisors (1).
104083597 is an equidigital number, since it uses as much as digits as its factorization.
104083597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 37.
The square root of 104083597 is about 10202.1368840062. The cubic root of 104083597 is about 470.3929066993.
The spelling of 104083597 in words is "one hundred four million, eighty-three thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •