6,797,610

2 × 3² × 5 × 47 × 1607

6,797,610 factors as 2 × 3^2 × 5 × 47 × 1607. Its 48 positive divisors give a proper-divisor sum of 11,263,446, so this integer is abundant. The Collatz stopping time is 85 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 47 × 1607

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 18,061,056

Proper Divisor Sum 11,263,446

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #6797591 ← → #6797639

Radix Representation

Decimal	6797610
Binary	11001111011100100101010 (23 bits)
Octal	0o31734452
Hexadecimal	0x67B92A

Divisor Catalog (48)

1 2 3 5 6 9 10 15 18 30 45 47 90 94 141 235 282 423 470 705 846 1,410 1,607 2,115 3,214 4,230 4,821 8,035 9,642 14,463 16,070 24,105 28,926 48,210 72,315 75,529 144,630 151,058 226,587 377,645 453,174 679,761 755,290 1,132,935 1,359,522 2,265,870 3,398,805 6,797,610

Collatz Trajectory (85 steps to reach 1)

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

6,797,610 3,398,805 10,196,416 5,098,208 2,549,104 1,274,552 637,276 318,638 159,319 477,958 238,979 716,938 358,469 1,075,408 537,704 268,852 134,426 67,213 201,640 100,820 50,410 25,205 75,616 37,808 18,904 9,452 4,726 2,363 7,090 3,545 10,636 5,318 2,659 7,978 3,989 11,968 5,984 2,992 1,496 748 374 187 562 281 844 422 211 634 317 952 476 238 119 358 179 538 269 808 404 202

← Previous Integer #6,797,609 Browse Full Index Next Integer #6,797,611 →