869,567

17 × 51151

869,567 factors as 17 × 51151. Its 4 positive divisors give a proper-divisor sum of 51,169, so this integer is deficient. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 17 × 51151

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 920,736

Proper Divisor Sum 51,169

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #869563 ← → #869579

Radix Representation

Decimal	869567
Binary	11010100010010111111 (20 bits)
Octal	0o3242277
Hexadecimal	0xD44BF

Divisor Catalog (4)

1 17 51,151 869,567

Collatz Trajectory (95 steps to reach 1)

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

869,567 2,608,702 1,304,351 3,913,054 1,956,527 5,869,582 2,934,791 8,804,374 4,402,187 13,206,562 6,603,281 19,809,844 9,904,922 4,952,461 14,857,384 7,428,692 3,714,346 1,857,173 5,571,520 2,785,760 1,392,880 696,440 348,220 174,110 87,055 261,166 130,583 391,750 195,875 587,626 293,813 881,440 440,720 220,360 110,180 55,090 27,545 82,636 41,318 20,659 61,978 30,989 92,968 46,484 23,242 11,621 34,864 17,432 8,716 4,358 2,179 6,538 3,269 9,808 4,904 2,452 1,226 613 1,840 920

← Previous Integer #869,566 Browse Full Index Next Integer #869,568 →