3,674,468

2² × 7 × 131231

3,674,468 factors as 2^2 × 7 × 131231. Its 12 positive divisors give a proper-divisor sum of 3,674,524, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 131231

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,348,992

Proper Divisor Sum 3,674,524

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #3674459 ← → #3674521

Radix Representation

Decimal	3674468
Binary	1110000001000101100100 (22 bits)
Octal	0o16010544
Hexadecimal	0x381164

Divisor Catalog (12)

1 2 4 7 14 28 131,231 262,462 524,924 918,617 1,837,234 3,674,468

Collatz Trajectory (172 steps to reach 1)

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

3,674,468 1,837,234 918,617 2,755,852 1,377,926 688,963 2,066,890 1,033,445 3,100,336 1,550,168 775,084 387,542 193,771 581,314 290,657 871,972 435,986 217,993 653,980 326,990 163,495 490,486 245,243 735,730 367,865 1,103,596 551,798 275,899 827,698 413,849 1,241,548 620,774 310,387 931,162 465,581 1,396,744 698,372 349,186 174,593 523,780 261,890 130,945 392,836 196,418 98,209 294,628 147,314 73,657 220,972 110,486 55,243 165,730 82,865 248,596 124,298 62,149 186,448 93,224 46,612 23,306

← Previous Integer #3,674,467 Browse Full Index Next Integer #3,674,469 →