4,158,232

2³ × 13 × 39983

4,158,232 factors as 2^3 × 13 × 39983. Its 16 positive divisors give a proper-divisor sum of 4,238,408, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 39983

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,396,640

Proper Divisor Sum 4,238,408

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #4158211 ← → #4158233

Radix Representation

Decimal	4158232
Binary	1111110111001100011000 (22 bits)
Octal	0o17671430
Hexadecimal	0x3F7318

Divisor Catalog (16)

1 2 4 8 13 26 52 104 39,983 79,966 159,932 319,864 519,779 1,039,558 2,079,116 4,158,232

Collatz Trajectory (167 steps to reach 1)

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

4,158,232 2,079,116 1,039,558 519,779 1,559,338 779,669 2,339,008 1,169,504 584,752 292,376 146,188 73,094 36,547 109,642 54,821 164,464 82,232 41,116 20,558 10,279 30,838 15,419 46,258 23,129 69,388 34,694 17,347 52,042 26,021 78,064 39,032 19,516 9,758 4,879 14,638 7,319 21,958 10,979 32,938 16,469 49,408 24,704 12,352 6,176 3,088 1,544 772 386 193 580 290 145 436 218 109 328 164 82 41 124

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,158,231 Browse Full Index Next Integer #4,158,233 →