Base | Representation |
---|---|
bin | 1100011110010… |
… | …00001100101101 |
3 | 21021212201001112 |
4 | 12033020030231 |
5 | 203241112122 |
6 | 14214321405 |
7 | 2410221632 |
oct | 617101455 |
9 | 237781045 |
10 | 104629037 |
11 | 54073387 |
12 | 2b059265 |
13 | 188a4796 |
14 | dc78189 |
15 | 92bb2e2 |
hex | 63c832d |
104629037 has 2 divisors, whose sum is σ = 104629038. Its totient is φ = 104629036.
The previous prime is 104628989. The next prime is 104629051. The reversal of 104629037 is 730926401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99480676 + 5148361 = 9974^2 + 2269^2 .
It is a cyclic number.
It is not a de Polignac number, because 104629037 - 212 = 104624941 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 104628994 and 104629012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104629087) 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, 52314518 + 52314519.
It is an arithmetic number, because the mean of its divisors is an integer number (52314519).
Almost surely, 2104629037 is an apocalyptic number.
It is an amenable number.
104629037 is a deficient number, since it is larger than the sum of its proper divisors (1).
104629037 is an equidigital number, since it uses as much as digits as its factorization.
104629037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
The square root of 104629037 is about 10228.8336089703. The cubic root of 104629037 is about 471.2131583560.
The spelling of 104629037 in words is "one hundred four million, six hundred twenty-nine thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •