3,554,328

2³ × 3 × 23 × 47 × 137

3,554,328 factors as 2^3 × 3 × 23 × 47 × 137. Its 64 positive divisors give a proper-divisor sum of 5,984,232, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 23 × 47 × 137

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 9,538,560

Proper Divisor Sum 5,984,232

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3554267 ← → #3554333

Radix Representation

Decimal	3554328
Binary	1101100011110000011000 (22 bits)
Octal	0o15436030
Hexadecimal	0x363C18

Divisor Catalog (60 of 64)

1 2 3 4 6 8 12 23 24 46 47 69 92 94 137 138 141 184 188 274 276 282 376 411 548 552 564 822 1,081 1,096 1,128 1,644 2,162 3,151 3,243 3,288 4,324 6,302 6,439 6,486 8,648 9,453 12,604 12,878 12,972 18,906 19,317 25,208 25,756 25,944 37,812 38,634 51,512 75,624 77,268 148,097 154,536 296,194 444,291 592,388

Collatz Trajectory (146 steps to reach 1)

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

3,554,328 1,777,164 888,582 444,291 1,332,874 666,437 1,999,312 999,656 499,828 249,914 124,957 374,872 187,436 93,718 46,859 140,578 70,289 210,868 105,434 52,717 158,152 79,076 39,538 19,769 59,308 29,654 14,827 44,482 22,241 66,724 33,362 16,681 50,044 25,022 12,511 37,534 18,767 56,302 28,151 84,454 42,227 126,682 63,341 190,024 95,012 47,506 23,753 71,260 35,630 17,815 53,446 26,723 80,170 40,085 120,256 60,128 30,064 15,032 7,516 3,758

← Previous Integer #3,554,327 Browse Full Index Next Integer #3,554,329 →