1,092,689

13 × 84053

1,092,689 factors as 13 × 84053. Its 4 positive divisors give a proper-divisor sum of 84,067, so this integer is deficient. The Collatz stopping time is 209 steps.

Prime Factor Structure

Factorization String 13 × 84053

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 1,176,756

Proper Divisor Sum 84,067

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #1092677 ← → #1092713

Radix Representation

Decimal	1092689
Binary	100001010110001010001 (21 bits)
Octal	0o4126121
Hexadecimal	0x10AC51

Divisor Catalog (4)

1 13 84,053 1,092,689

Collatz Trajectory (209 steps to reach 1)

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

1,092,689 3,278,068 1,639,034 819,517 2,458,552 1,229,276 614,638 307,319 921,958 460,979 1,382,938 691,469 2,074,408 1,037,204 518,602 259,301 777,904 388,952 194,476 97,238 48,619 145,858 72,929 218,788 109,394 54,697 164,092 82,046 41,023 123,070 61,535 184,606 92,303 276,910 138,455 415,366 207,683 623,050 311,525 934,576 467,288 233,644 116,822 58,411 175,234 87,617 262,852 131,426 65,713 197,140 98,570 49,285 147,856 73,928 36,964 18,482 9,241 27,724 13,862 6,931

← Previous Integer #1,092,688 Browse Full Index Next Integer #1,092,690 →