3,325,896

2³ × 3² × 7 × 6599

3,325,896 factors as 2^3 × 3^2 × 7 × 6599. Its 48 positive divisors give a proper-divisor sum of 6,970,104, so this integer is abundant. The Collatz stopping time is 208 steps.

Prime Factor Structure

Factorization String 2^3 × 3^2 × 7 × 6599

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 10,296,000

Proper Divisor Sum 6,970,104

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3325877 ← → #3325901

Radix Representation

Decimal	3325896
Binary	1100101011111111001000 (22 bits)
Octal	0o14537710
Hexadecimal	0x32BFC8

Divisor Catalog (48)

1 2 3 4 6 7 8 9 12 14 18 21 24 28 36 42 56 63 72 84 126 168 252 504 6,599 13,198 19,797 26,396 39,594 46,193 52,792 59,391 79,188 92,386 118,782 138,579 158,376 184,772 237,564 277,158 369,544 415,737 475,128 554,316 831,474 1,108,632 1,662,948 3,325,896

Collatz Trajectory (208 steps to reach 1)

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

3,325,896 1,662,948 831,474 415,737 1,247,212 623,606 311,803 935,410 467,705 1,403,116 701,558 350,779 1,052,338 526,169 1,578,508 789,254 394,627 1,183,882 591,941 1,775,824 887,912 443,956 221,978 110,989 332,968 166,484 83,242 41,621 124,864 62,432 31,216 15,608 7,804 3,902 1,951 5,854 2,927 8,782 4,391 13,174 6,587 19,762 9,881 29,644 14,822 7,411 22,234 11,117 33,352 16,676 8,338 4,169 12,508 6,254 3,127 9,382 4,691 14,074 7,037 21,112

← Previous Integer #3,325,895 Browse Full Index Next Integer #3,325,897 →