6,744,234

2 × 3 × 7 × 103 × 1559

6,744,234 factors as 2 × 3 × 7 × 103 × 1559. Its 32 positive divisors give a proper-divisor sum of 8,830,806, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 103 × 1559

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 15,575,040

Proper Divisor Sum 8,830,806

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6744233 ← → #6744239

Radix Representation

Decimal	6744234
Binary	11001101110100010101010 (23 bits)
Octal	0o31564252
Hexadecimal	0x66E8AA

Divisor Catalog (32)

1 2 3 6 7 14 21 42 103 206 309 618 721 1,442 1,559 2,163 3,118 4,326 4,677 9,354 10,913 21,826 32,739 65,478 160,577 321,154 481,731 963,462 1,124,039 2,248,078 3,372,117 6,744,234

Collatz Trajectory (147 steps to reach 1)

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

6,744,234 3,372,117 10,116,352 5,058,176 2,529,088 1,264,544 632,272 316,136 158,068 79,034 39,517 118,552 59,276 29,638 14,819 44,458 22,229 66,688 33,344 16,672 8,336 4,168 2,084 1,042 521 1,564 782 391 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206

← Previous Integer #6,744,233 Browse Full Index Next Integer #6,744,235 →