Base | Representation |
---|---|
bin | 1100011001110… |
… | …11100100000101 |
3 | 21020210102212201 |
4 | 12030323210011 |
5 | 203114143442 |
6 | 14154114501 |
7 | 2402302336 |
oct | 614734405 |
9 | 236712781 |
10 | 104052997 |
11 | 5380a614 |
12 | 2aa1ba31 |
13 | 18732529 |
14 | db6828d |
15 | 92057b7 |
hex | 633b905 |
104052997 has 2 divisors, whose sum is σ = 104052998. Its totient is φ = 104052996.
The previous prime is 104052979. The next prime is 104053003. The reversal of 104052997 is 799250401.
Together with previous prime (104052979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77334436 + 26718561 = 8794^2 + 5169^2 .
It is a cyclic number.
It is not a de Polignac number, because 104052997 - 211 = 104050949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104052097) 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, 52026498 + 52026499.
It is an arithmetic number, because the mean of its divisors is an integer number (52026499).
Almost surely, 2104052997 is an apocalyptic number.
It is an amenable number.
104052997 is a deficient number, since it is larger than the sum of its proper divisors (1).
104052997 is an equidigital number, since it uses as much as digits as its factorization.
104052997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 37.
The square root of 104052997 is about 10200.6370879470. The cubic root of 104052997 is about 470.3468045463.
The spelling of 104052997 in words is "one hundred four million, fifty-two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •