1,244,028

2² × 3 × 103669

1,244,028 factors as 2^2 × 3 × 103669. Its 12 positive divisors give a proper-divisor sum of 1,658,732, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 103669

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,902,760

Proper Divisor Sum 1,658,732

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1244027 ← → #1244029

Radix Representation

Decimal	1244028
Binary	100101111101101111100 (21 bits)
Octal	0o4575574
Hexadecimal	0x12FB7C

Divisor Catalog (12)

1 2 3 4 6 12 103,669 207,338 311,007 414,676 622,014 1,244,028

Collatz Trajectory (129 steps to reach 1)

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

1,244,028 622,014 311,007 933,022 466,511 1,399,534 699,767 2,099,302 1,049,651 3,148,954 1,574,477 4,723,432 2,361,716 1,180,858 590,429 1,771,288 885,644 442,822 221,411 664,234 332,117 996,352 498,176 249,088 124,544 62,272 31,136 15,568 7,784 3,892 1,946 973 2,920 1,460 730 365 1,096 548 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336

More profiles

2,093,465 3,313,612 9,692,131 8,572,019 9,407,230 5,894,702 1,896,218 4,047,961 8,079,497 1,318,260 5,479,244 9,762,001 6,398,579 3,036,453 1,674,156 105,865

← Previous Integer #1,244,027 Browse Full Index Next Integer #1,244,029 →