1,268,832

2⁵ × 3 × 13217

1,268,832 factors as 2^5 × 3 × 13217. Its 24 positive divisors give a proper-divisor sum of 2,062,104, so this integer is abundant. The Collatz stopping time is 142 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 13217

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 3,330,936

Proper Divisor Sum 2,062,104

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1268807 ← → #1268843

Radix Representation

Decimal	1268832
Binary	100110101110001100000 (21 bits)
Octal	0o4656140
Hexadecimal	0x135C60

Divisor Catalog (24)

1 2 3 4 6 8 12 16 24 32 48 96 13,217 26,434 39,651 52,868 79,302 105,736 158,604 211,472 317,208 422,944 634,416 1,268,832

Collatz Trajectory (142 steps to reach 1)

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

1,268,832 634,416 317,208 158,604 79,302 39,651 118,954 59,477 178,432 89,216 44,608 22,304 11,152 5,576 2,788 1,394 697 2,092 1,046 523 1,570 785 2,356 1,178 589 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 310 155 466 233

← Previous Integer #1,268,831 Browse Full Index Next Integer #1,268,833 →