1,073,724

2² × 3 × 89477

1,073,724 factors as 2^2 × 3 × 89477. Its 12 positive divisors give a proper-divisor sum of 1,431,660, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 89477

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,505,384

Proper Divisor Sum 1,431,660

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1073717 ← → #1073729

Radix Representation

Decimal	1073724
Binary	100000110001000111100 (21 bits)
Octal	0o4061074
Hexadecimal	0x10623C

Divisor Catalog (12)

1 2 3 4 6 12 89,477 178,954 268,431 357,908 536,862 1,073,724

Collatz Trajectory (121 steps to reach 1)

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

1,073,724 536,862 268,431 805,294 402,647 1,207,942 603,971 1,811,914 905,957 2,717,872 1,358,936 679,468 339,734 169,867 509,602 254,801 764,404 382,202 191,101 573,304 286,652 143,326 71,663 214,990 107,495 322,486 161,243 483,730 241,865 725,596 362,798 181,399 544,198 272,099 816,298 408,149 1,224,448 612,224 306,112 153,056 76,528 38,264 19,132 9,566 4,783 14,350 7,175 21,526 10,763 32,290 16,145 48,436 24,218 12,109 36,328 18,164 9,082 4,541 13,624 6,812

← Previous Integer #1,073,723 Browse Full Index Next Integer #1,073,725 →