1,048,496

2⁴ × 19 × 3449

1,048,496 factors as 2^4 × 19 × 3449. Its 20 positive divisors give a proper-divisor sum of 1,090,504, so this integer is abundant. The Collatz stopping time is 165 steps.

Prime Factor Structure

Factorization String 2^4 × 19 × 3449

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 2,139,000

Proper Divisor Sum 1,090,504

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #1048447 ← → #1048507

Radix Representation

Decimal	1048496
Binary	11111111111110110000 (20 bits)
Octal	0o3777660
Hexadecimal	0xFFFB0

Divisor Catalog (20)

1 2 4 8 16 19 38 76 152 304 3,449 6,898 13,796 27,592 55,184 65,531 131,062 262,124 524,248 1,048,496

Collatz Trajectory (165 steps to reach 1)

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

1,048,496 524,248 262,124 131,062 65,531 196,594 98,297 294,892 147,446 73,723 221,170 110,585 331,756 165,878 82,939 248,818 124,409 373,228 186,614 93,307 279,922 139,961 419,884 209,942 104,971 314,914 157,457 472,372 236,186 118,093 354,280 177,140 88,570 44,285 132,856 66,428 33,214 16,607 49,822 24,911 74,734 37,367 112,102 56,051 168,154 84,077 252,232 126,116 63,058 31,529 94,588 47,294 23,647 70,942 35,471 106,414 53,207 159,622 79,811 239,434

← Previous Integer #1,048,495 Browse Full Index Next Integer #1,048,497 →