Base | Representation |
---|---|
bin | 110000110000011100… |
… | …0000011011000001001 |
3 | 101000021001000210211112 |
4 | 1201200320003120021 |
5 | 3203413324143422 |
6 | 120033421140105 |
7 | 10364450515214 |
oct | 1414070033011 |
9 | 330231023745 |
10 | 104704521737 |
11 | 4044aa779a2 |
12 | 183613ba635 |
13 | 9b4839470a |
14 | 50d3ba877b |
15 | 2acc276ee2 |
hex | 1860e03609 |
104704521737 has 2 divisors, whose sum is σ = 104704521738. Its totient is φ = 104704521736.
The previous prime is 104704521703. The next prime is 104704521751. The reversal of 104704521737 is 737125407401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104119800976 + 584720761 = 322676^2 + 24181^2 .
It is an emirp because it is prime and its reverse (737125407401) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104704521737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104704521694 and 104704521703.
It is not a weakly prime, because it can be changed into another prime (104704521767) 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, 52352260868 + 52352260869.
It is an arithmetic number, because the mean of its divisors is an integer number (52352260869).
Almost surely, 2104704521737 is an apocalyptic number.
It is an amenable number.
104704521737 is a deficient number, since it is larger than the sum of its proper divisors (1).
104704521737 is an equidigital number, since it uses as much as digits as its factorization.
104704521737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 164640, while the sum is 41.
The spelling of 104704521737 in words is "one hundred four billion, seven hundred four million, five hundred twenty-one thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •