1,041,090

2 × 3 × 5 × 34703

1,041,090 factors as 2 × 3 × 5 × 34703. Its 16 positive divisors give a proper-divisor sum of 1,457,598, so this integer is abundant. The Collatz stopping time is 165 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 34703

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,498,688

Proper Divisor Sum 1,457,598

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #1041083 ← → #1041091

Radix Representation

Decimal	1041090
Binary	11111110001011000010 (20 bits)
Octal	0o3761302
Hexadecimal	0xFE2C2

Divisor Catalog (16)

1 2 3 5 6 10 15 30 34,703 69,406 104,109 173,515 208,218 347,030 520,545 1,041,090

Collatz Trajectory (165 steps to reach 1)

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

1,041,090 520,545 1,561,636 780,818 390,409 1,171,228 585,614 292,807 878,422 439,211 1,317,634 658,817 1,976,452 988,226 494,113 1,482,340 741,170 370,585 1,111,756 555,878 277,939 833,818 416,909 1,250,728 625,364 312,682 156,341 469,024 234,512 117,256 58,628 29,314 14,657 43,972 21,986 10,993 32,980 16,490 8,245 24,736 12,368 6,184 3,092 1,546 773 2,320 1,160 580 290 145 436 218 109 328 164 82 41 124 62 31

← Previous Integer #1,041,089 Browse Full Index Next Integer #1,041,091 →