Base | Representation |
---|---|
bin | 1100011110100… |
… | …10100101000101 |
3 | 21021221212101100 |
4 | 12033102211011 |
5 | 203243442212 |
6 | 14215250313 |
7 | 2410456614 |
oct | 617224505 |
9 | 237855340 |
10 | 104671557 |
11 | 540a2321 |
12 | 2b079999 |
13 | 188bac43 |
14 | dc8987b |
15 | 92c8bdc |
hex | 63d2945 |
104671557 has 12 divisors (see below), whose sum is σ = 155279020. Its totient is φ = 67894848.
The previous prime is 104671543. The next prime is 104671571. The reversal of 104671557 is 755176401.
It is an interprime number because it is at equal distance from previous prime (104671543) and next prime (104671571).
It can be written as a sum of positive squares in 2 ways, for example, as 99980001 + 4691556 = 9999^2 + 2166^2 .
It is not a de Polignac number, because 104671557 - 26 = 104671493 is a prime.
It is a super-2 number, since 2×1046715572 = 21912269689608498, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104671577) 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 in 11 ways as a sum of consecutive naturals, for example, 156832 + ... + 157497.
Almost surely, 2104671557 is an apocalyptic number.
It is an amenable number.
104671557 is a deficient number, since it is larger than the sum of its proper divisors (50607463).
104671557 is a wasteful number, since it uses less digits than its factorization.
104671557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314372 (or 314369 counting only the distinct ones).
The product of its (nonzero) digits is 29400, while the sum is 36.
The square root of 104671557 is about 10230.9118361952. The cubic root of 104671557 is about 471.2769815245.
The spelling of 104671557 in words is "one hundred four million, six hundred seventy-one thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •