Base | Representation |
---|---|
bin | 1100011110011… |
… | …11001100000111 |
3 | 21021221011100001 |
4 | 12033033030013 |
5 | 203243021141 |
6 | 14215102131 |
7 | 2410401256 |
oct | 617171407 |
9 | 237834301 |
10 | 104657671 |
11 | 54092948 |
12 | 2b071947 |
13 | 188b4821 |
14 | dc8479d |
15 | 92c4a31 |
hex | 63cf307 |
104657671 has 2 divisors, whose sum is σ = 104657672. Its totient is φ = 104657670.
The previous prime is 104657633. The next prime is 104657689. The reversal of 104657671 is 176756401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104657671 - 29 = 104657159 is a prime.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 104657671.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104657071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52328835 + 52328836.
It is an arithmetic number, because the mean of its divisors is an integer number (52328836).
Almost surely, 2104657671 is an apocalyptic number.
104657671 is a deficient number, since it is larger than the sum of its proper divisors (1).
104657671 is an equidigital number, since it uses as much as digits as its factorization.
104657671 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280, while the sum is 37.
The square root of 104657671 is about 10230.2331840482. The cubic root of 104657671 is about 471.2561403276.
The spelling of 104657671 in words is "one hundred four million, six hundred fifty-seven thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •