262,794

2 × 3 × 7 × 6257

262,794 factors as 2 × 3 × 7 × 6257. Its 16 positive divisors give a proper-divisor sum of 337,974, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 6257

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 600,768

Proper Divisor Sum 337,974

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #262783 ← → #262807

Radix Representation

Decimal	262794
Binary	1000000001010001010 (19 bits)
Octal	0o1001212
Hexadecimal	0x4028A

Divisor Catalog (16)

1 2 3 6 7 14 21 42 6,257 12,514 18,771 37,542 43,799 87,598 131,397 262,794

Collatz Trajectory (163 steps to reach 1)

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

262,794 131,397 394,192 197,096 98,548 49,274 24,637 73,912 36,956 18,478 9,239 27,718 13,859 41,578 20,789 62,368 31,184 15,592 7,796 3,898 1,949 5,848 2,924 1,462 731 2,194 1,097 3,292 1,646 823 2,470 1,235 3,706 1,853 5,560 2,780 1,390 695 2,086 1,043 3,130 1,565 4,696 2,348 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47

← Previous Integer #262,793 Browse Full Index Next Integer #262,795 →