860,104

2³ × 7 × 15359

860,104 factors as 2^3 × 7 × 15359. Its 16 positive divisors give a proper-divisor sum of 983,096, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 15359

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,843,200

Proper Divisor Sum 983,096

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #860089 ← → #860107

Radix Representation

Decimal	860104
Binary	11010001111111001000 (20 bits)
Octal	0o3217710
Hexadecimal	0xD1FC8

Divisor Catalog (16)

1 2 4 7 8 14 28 56 15,359 30,718 61,436 107,513 122,872 215,026 430,052 860,104

Collatz Trajectory (74 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

860,104 430,052 215,026 107,513 322,540 161,270 80,635 241,906 120,953 362,860 181,430 90,715 272,146 136,073 408,220 204,110 102,055 306,166 153,083 459,250 229,625 688,876 344,438 172,219 516,658 258,329 774,988 387,494 193,747 581,242 290,621 871,864 435,932 217,966 108,983 326,950 163,475 490,426 245,213 735,640 367,820 183,910 91,955 275,866 137,933 413,800 206,900 103,450 51,725 155,176 77,588 38,794 19,397 58,192 29,096 14,548 7,274 3,637 10,912 5,456

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #860,103 Browse Full Index Next Integer #860,105 →