1,069,296

2⁴ × 3 × 22277

1,069,296 factors as 2^4 × 3 × 22277. Its 20 positive divisors give a proper-divisor sum of 1,693,176, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 22277

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 2,762,472

Proper Divisor Sum 1,693,176

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1069291 ← → #1069303

Radix Representation

Decimal	1069296
Binary	100000101000011110000 (21 bits)
Octal	0o4050360
Hexadecimal	0x1050F0

Divisor Catalog (20)

Collatz Trajectory (121 steps to reach 1)

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

1,069,296 534,648 267,324 133,662 66,831 200,494 100,247 300,742 150,371 451,114 225,557 676,672 338,336 169,168 84,584 42,292 21,146 10,573 31,720 15,860 7,930 3,965 11,896 5,948 2,974 1,487 4,462 2,231 6,694 3,347 10,042 5,021 15,064 7,532 3,766 1,883 5,650 2,825 8,476 4,238 2,119 6,358 3,179 9,538 4,769 14,308 7,154 3,577 10,732 5,366 2,683 8,050 4,025 12,076 6,038 3,019 9,058 4,529 13,588 6,794

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,069,295 Browse Full Index Next Integer #1,069,297 →