6,545,676

2² × 3 × 545473

6,545,676 factors as 2^2 × 3 × 545473. Its 12 positive divisors give a proper-divisor sum of 8,727,596, so this integer is abundant. The Collatz stopping time is 284 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 545473

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 15,273,272

Proper Divisor Sum 8,727,596

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6545653 ← → #6545687

Radix Representation

Decimal	6545676
Binary	11000111110000100001100 (23 bits)
Octal	0o30760414
Hexadecimal	0x63E10C

Divisor Catalog (12)

1 2 3 4 6 12 545,473 1,090,946 1,636,419 2,181,892 3,272,838 6,545,676

Collatz Trajectory (284 steps to reach 1)

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

6,545,676 3,272,838 1,636,419 4,909,258 2,454,629 7,363,888 3,681,944 1,840,972 920,486 460,243 1,380,730 690,365 2,071,096 1,035,548 517,774 258,887 776,662 388,331 1,164,994 582,497 1,747,492 873,746 436,873 1,310,620 655,310 327,655 982,966 491,483 1,474,450 737,225 2,211,676 1,105,838 552,919 1,658,758 829,379 2,488,138 1,244,069 3,732,208 1,866,104 933,052 466,526 233,263 699,790 349,895 1,049,686 524,843 1,574,530 787,265 2,361,796 1,180,898 590,449 1,771,348 885,674 442,837 1,328,512 664,256 332,128 166,064 83,032 41,516

← Previous Integer #6,545,675 Browse Full Index Next Integer #6,545,677 →