3,300,696

2³ × 3³ × 7 × 37 × 59

3,300,696 factors as 2^3 × 3^3 × 7 × 37 × 59. Its 128 positive divisors give a proper-divisor sum of 7,643,304, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^3 × 3^3 × 7 × 37 × 59

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 128

Divisor Sum (σ) 10,944,000

Proper Divisor Sum 7,643,304

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3300691 ← → #3300697

Radix Representation

Decimal	3300696
Binary	1100100101110101011000 (22 bits)
Octal	0o14456530
Hexadecimal	0x325D58

Divisor Catalog (60 of 128)

1 2 3 4 6 7 8 9 12 14 18 21 24 27 28 36 37 42 54 56 59 63 72 74 84 108 111 118 126 148 168 177 189 216 222 236 252 259 296 333 354 378 413 444 472 504 518 531 666 708 756 777 826 888 999 1,036 1,062 1,239 1,332 1,416

Collatz Trajectory (84 steps to reach 1)

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

3,300,696 1,650,348 825,174 412,587 1,237,762 618,881 1,856,644 928,322 464,161 1,392,484 696,242 348,121 1,044,364 522,182 261,091 783,274 391,637 1,174,912 587,456 293,728 146,864 73,432 36,716 18,358 9,179 27,538 13,769 41,308 20,654 10,327 30,982 15,491 46,474 23,237 69,712 34,856 17,428 8,714 4,357 13,072 6,536 3,268 1,634 817 2,452 1,226 613 1,840 920 460 230 115 346 173 520 260 130 65 196 98

← Previous Integer #3,300,695 Browse Full Index Next Integer #3,300,697 →