1,624,878

2 × 3² × 90271

1,624,878 factors as 2 × 3^2 × 90271. Its 12 positive divisors give a proper-divisor sum of 1,895,730, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 90271

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,520,608

Proper Divisor Sum 1,895,730

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #1624849 ← → #1624913

Radix Representation

Decimal	1624878
Binary	110001100101100101110 (21 bits)
Octal	0o6145456
Hexadecimal	0x18CB2E

Divisor Catalog (12)

1 2 3 6 9 18 90,271 180,542 270,813 541,626 812,439 1,624,878

Collatz Trajectory (114 steps to reach 1)

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

1,624,878 812,439 2,437,318 1,218,659 3,655,978 1,827,989 5,483,968 2,741,984 1,370,992 685,496 342,748 171,374 85,687 257,062 128,531 385,594 192,797 578,392 289,196 144,598 72,299 216,898 108,449 325,348 162,674 81,337 244,012 122,006 61,003 183,010 91,505 274,516 137,258 68,629 205,888 102,944 51,472 25,736 12,868 6,434 3,217 9,652 4,826 2,413 7,240 3,620 1,810 905 2,716 1,358 679 2,038 1,019 3,058 1,529 4,588 2,294 1,147 3,442 1,721

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,624,877 Browse Full Index Next Integer #1,624,879 →