3,973,158

2 × 3³ × 7 × 23 × 457

3,973,158 factors as 2 × 3^3 × 7 × 23 × 457. Its 64 positive divisors give a proper-divisor sum of 6,579,162, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 7 × 23 × 457

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 10,552,320

Proper Divisor Sum 6,579,162

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3973153 ← → #3973163

Radix Representation

Decimal	3973158
Binary	1111001010000000100110 (22 bits)
Octal	0o17120046
Hexadecimal	0x3CA026

Divisor Catalog (60 of 64)

1 2 3 6 7 9 14 18 21 23 27 42 46 54 63 69 126 138 161 189 207 322 378 414 457 483 621 914 966 1,242 1,371 1,449 2,742 2,898 3,199 4,113 4,347 6,398 8,226 8,694 9,597 10,511 12,339 19,194 21,022 24,678 28,791 31,533 57,582 63,066 73,577 86,373 94,599 147,154 172,746 189,198 220,731 283,797 441,462 567,594

Collatz Trajectory (154 steps to reach 1)

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

3,973,158 1,986,579 5,959,738 2,979,869 8,939,608 4,469,804 2,234,902 1,117,451 3,352,354 1,676,177 5,028,532 2,514,266 1,257,133 3,771,400 1,885,700 942,850 471,425 1,414,276 707,138 353,569 1,060,708 530,354 265,177 795,532 397,766 198,883 596,650 298,325 894,976 447,488 223,744 111,872 55,936 27,968 13,984 6,992 3,496 1,748 874 437 1,312 656 328 164 82 41 124 62 31 94 47 142 71 214 107 322 161 484 242 121

← Previous Integer #3,973,157 Browse Full Index Next Integer #3,973,159 →