3,280,458

2 × 3 × 61 × 8963

3,280,458 factors as 2 × 3 × 61 × 8963. Its 16 positive divisors give a proper-divisor sum of 3,388,758, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2 × 3 × 61 × 8963

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,669,216

Proper Divisor Sum 3,388,758

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3280441 ← → #3280463

Radix Representation

Decimal	3280458
Binary	1100100000111001001010 (22 bits)
Octal	0o14407112
Hexadecimal	0x320E4A

Divisor Catalog (16)

1 2 3 6 61 122 183 366 8,963 17,926 26,889 53,778 546,743 1,093,486 1,640,229 3,280,458

Collatz Trajectory (84 steps to reach 1)

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

3,280,458 1,640,229 4,920,688 2,460,344 1,230,172 615,086 307,543 922,630 461,315 1,383,946 691,973 2,075,920 1,037,960 518,980 259,490 129,745 389,236 194,618 97,309 291,928 145,964 72,982 36,491 109,474 54,737 164,212 82,106 41,053 123,160 61,580 30,790 15,395 46,186 23,093 69,280 34,640 17,320 8,660 4,330 2,165 6,496 3,248 1,624 812 406 203 610 305 916 458 229 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,457 Browse Full Index Next Integer #3,280,459 →