3,280,644

2² × 3² × 91129

3,280,644 factors as 2^2 × 3^2 × 91129. Its 18 positive divisors give a proper-divisor sum of 5,012,186, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 91129

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 8,292,830

Proper Divisor Sum 5,012,186

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3280639 ← → #3280649

Radix Representation

Decimal	3280644
Binary	1100100000111100000100 (22 bits)
Octal	0o14407404
Hexadecimal	0x320F04

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 91,129 182,258 273,387 364,516 546,774 820,161 1,093,548 1,640,322 3,280,644

Collatz Trajectory (84 steps to reach 1)

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

3,280,644 1,640,322 820,161 2,460,484 1,230,242 615,121 1,845,364 922,682 461,341 1,384,024 692,012 346,006 173,003 519,010 259,505 778,516 389,258 194,629 583,888 291,944 145,972 72,986 36,493 109,480 54,740 27,370 13,685 41,056 20,528 10,264 5,132 2,566 1,283 3,850 1,925 5,776 2,888 1,444 722 361 1,084 542 271 814 407 1,222 611 1,834 917 2,752 1,376 688 344 172 86 43 130 65 196 98

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,280,643 Browse Full Index Next Integer #3,280,645 →