159,656

2³ × 7 × 2851

159,656 factors as 2^3 × 7 × 2851. Its 16 positive divisors give a proper-divisor sum of 182,584, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 2851

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 342,240

Proper Divisor Sum 182,584

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #159631 ← → #159667

Radix Representation

Decimal	159656
Binary	100110111110101000 (18 bits)
Octal	0o467650
Hexadecimal	0x26FA8

Divisor Catalog (16)

1 2 4 7 8 14 28 56 2,851 5,702 11,404 19,957 22,808 39,914 79,828 159,656

Collatz Trajectory (139 steps to reach 1)

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

159,656 79,828 39,914 19,957 59,872 29,936 14,968 7,484 3,742 1,871 5,614 2,807 8,422 4,211 12,634 6,317 18,952 9,476 4,738 2,369 7,108 3,554 1,777 5,332 2,666 1,333 4,000 2,000 1,000 500 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175

← Previous Integer #159,655 Browse Full Index Next Integer #159,657 →