565,026

2 × 3 × 7 × 11 × 1223

565,026 factors as 2 × 3 × 7 × 11 × 1223. Its 32 positive divisors give a proper-divisor sum of 845,022, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 11 × 1223

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 1,410,048

Proper Divisor Sum 845,022

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #565013 ← → #565039

Radix Representation

Decimal	565026
Binary	10001001111100100010 (20 bits)
Octal	0o2117442
Hexadecimal	0x89F22

Divisor Catalog (32)

1 2 3 6 7 11 14 21 22 33 42 66 77 154 231 462 1,223 2,446 3,669 7,338 8,561 13,453 17,122 25,683 26,906 40,359 51,366 80,718 94,171 188,342 282,513 565,026

Collatz Trajectory (146 steps to reach 1)

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

565,026 282,513 847,540 423,770 211,885 635,656 317,828 158,914 79,457 238,372 119,186 59,593 178,780 89,390 44,695 134,086 67,043 201,130 100,565 301,696 150,848 75,424 37,712 18,856 9,428 4,714 2,357 7,072 3,536 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103

← Previous Integer #565,025 Browse Full Index Next Integer #565,027 →