3,148,638

2 × 3 × 17 × 30869

3,148,638 factors as 2 × 3 × 17 × 30869. Its 16 positive divisors give a proper-divisor sum of 3,519,282, so this integer is abundant. The Collatz stopping time is 102 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 30869

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,667,920

Proper Divisor Sum 3,519,282

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3148633 ← → #3148657

Radix Representation

Decimal	3148638
Binary	1100000000101101011110 (22 bits)
Octal	0o14005536
Hexadecimal	0x300B5E

Divisor Catalog (16)

1 2 3 6 17 34 51 102 30,869 61,738 92,607 185,214 524,773 1,049,546 1,574,319 3,148,638

Collatz Trajectory (102 steps to reach 1)

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

3,148,638 1,574,319 4,722,958 2,361,479 7,084,438 3,542,219 10,626,658 5,313,329 15,939,988 7,969,994 3,984,997 11,954,992 5,977,496 2,988,748 1,494,374 747,187 2,241,562 1,120,781 3,362,344 1,681,172 840,586 420,293 1,260,880 630,440 315,220 157,610 78,805 236,416 118,208 59,104 29,552 14,776 7,388 3,694 1,847 5,542 2,771 8,314 4,157 12,472 6,236 3,118 1,559 4,678 2,339 7,018 3,509 10,528 5,264 2,632 1,316 658 329 988 494 247 742 371 1,114 557

← Previous Integer #3,148,637 Browse Full Index Next Integer #3,148,639 →