3,643,584

2⁶ × 3 × 7 × 2711

3,643,584 factors as 2^6 × 3 × 7 × 2711. Its 56 positive divisors give a proper-divisor sum of 7,377,984, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 7 × 2711

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 56

Divisor Sum (σ) 11,021,568

Proper Divisor Sum 7,377,984

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3643579 ← → #3643603

Radix Representation

Decimal	3643584
Binary	1101111001100011000000 (22 bits)
Octal	0o15714300
Hexadecimal	0x3798C0

Divisor Catalog (56)

1 2 3 4 6 7 8 12 14 16 21 24 28 32 42 48 56 64 84 96 112 168 192 224 336 448 672 1,344 2,711 5,422 8,133 10,844 16,266 18,977 21,688 32,532 37,954 43,376 56,931 65,064 75,908 86,752 113,862 130,128 151,816 173,504 227,724 260,256 303,632 455,448 520,512 607,264 910,896 1,214,528 1,821,792 3,643,584

Collatz Trajectory (66 steps to reach 1)

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

3,643,584 1,821,792 910,896 455,448 227,724 113,862 56,931 170,794 85,397 256,192 128,096 64,048 32,024 16,012 8,006 4,003 12,010 6,005 18,016 9,008 4,504 2,252 1,126 563 1,690 845 2,536 1,268 634 317 952 476 238 119 358 179 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20

← Previous Integer #3,643,583 Browse Full Index Next Integer #3,643,585 →