1,089,438

2 × 3 × 7 × 25939

1,089,438 factors as 2 × 3 × 7 × 25939. Its 16 positive divisors give a proper-divisor sum of 1,400,802, so this integer is abundant. The Collatz stopping time is 271 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 25939

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,490,240

Proper Divisor Sum 1,400,802

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1089427 ← → #1089457

Radix Representation

Decimal	1089438
Binary	100001001111110011110 (21 bits)
Octal	0o4117636
Hexadecimal	0x109F9E

Divisor Catalog (16)

1 2 3 6 7 14 21 42 25,939 51,878 77,817 155,634 181,573 363,146 544,719 1,089,438

Collatz Trajectory (271 steps to reach 1)

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

1,089,438 544,719 1,634,158 817,079 2,451,238 1,225,619 3,676,858 1,838,429 5,515,288 2,757,644 1,378,822 689,411 2,068,234 1,034,117 3,102,352 1,551,176 775,588 387,794 193,897 581,692 290,846 145,423 436,270 218,135 654,406 327,203 981,610 490,805 1,472,416 736,208 368,104 184,052 92,026 46,013 138,040 69,020 34,510 17,255 51,766 25,883 77,650 38,825 116,476 58,238 29,119 87,358 43,679 131,038 65,519 196,558 98,279 294,838 147,419 442,258 221,129 663,388 331,694 165,847 497,542 248,771

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,089,437 Browse Full Index Next Integer #1,089,439 →