4,428,342

2 × 3² × 157 × 1567

4,428,342 factors as 2 × 3^2 × 157 × 1567. Its 24 positive divisors give a proper-divisor sum of 5,233,674, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 157 × 1567

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 9,662,016

Proper Divisor Sum 5,233,674

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4428337 ← → #4428353

Radix Representation

Decimal	4428342
Binary	10000111001001000110110 (23 bits)
Octal	0o20711066
Hexadecimal	0x439236

Divisor Catalog (24)

Collatz Trajectory (136 steps to reach 1)

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

4,428,342 2,214,171 6,642,514 3,321,257 9,963,772 4,981,886 2,490,943 7,472,830 3,736,415 11,209,246 5,604,623 16,813,870 8,406,935 25,220,806 12,610,403 37,831,210 18,915,605 56,746,816 28,373,408 14,186,704 7,093,352 3,546,676 1,773,338 886,669 2,660,008 1,330,004 665,002 332,501 997,504 498,752 249,376 124,688 62,344 31,172 15,586 7,793 23,380 11,690 5,845 17,536 8,768 4,384 2,192 1,096 548 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,428,341 Browse Full Index Next Integer #4,428,343 →