627,054

2 × 3 × 41 × 2549

627,054 factors as 2 × 3 × 41 × 2549. Its 16 positive divisors give a proper-divisor sum of 658,146, so this integer is abundant. The Collatz stopping time is 203 steps.

Prime Factor Structure

Factorization String 2 × 3 × 41 × 2549

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,285,200

Proper Divisor Sum 658,146

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #627041 ← → #627059

Radix Representation

Decimal	627054
Binary	10011001000101101110 (20 bits)
Octal	0o2310556
Hexadecimal	0x9916E

Divisor Catalog (16)

1 2 3 6 41 82 123 246 2,549 5,098 7,647 15,294 104,509 209,018 313,527 627,054

Collatz Trajectory (203 steps to reach 1)

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

627,054 313,527 940,582 470,291 1,410,874 705,437 2,116,312 1,058,156 529,078 264,539 793,618 396,809 1,190,428 595,214 297,607 892,822 446,411 1,339,234 669,617 2,008,852 1,004,426 502,213 1,506,640 753,320 376,660 188,330 94,165 282,496 141,248 70,624 35,312 17,656 8,828 4,414 2,207 6,622 3,311 9,934 4,967 14,902 7,451 22,354 11,177 33,532 16,766 8,383 25,150 12,575 37,726 18,863 56,590 28,295 84,886 42,443 127,330 63,665 190,996 95,498 47,749 143,248

← Previous Integer #627,053 Browse Full Index Next Integer #627,055 →