1,066,338

2 × 3³ × 7² × 13 × 31

1,066,338 factors as 2 × 3^3 × 7^2 × 13 × 31. Its 96 positive divisors give a proper-divisor sum of 1,997,982, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 7^2 × 13 × 31

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 3,064,320

Proper Divisor Sum 1,997,982

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1066333 ← → #1066339

Radix Representation

Decimal	1066338
Binary	100000100010101100010 (21 bits)
Octal	0o4042542
Hexadecimal	0x104562

Divisor Catalog (60 of 96)

1 2 3 6 7 9 13 14 18 21 26 27 31 39 42 49 54 62 63 78 91 93 98 117 126 147 182 186 189 217 234 273 279 294 351 378 403 434 441 546 558 637 651 702 806 819 837 882 1,209 1,274 1,302 1,323 1,519 1,638 1,674 1,911 1,953 2,418 2,457 2,646

Collatz Trajectory (95 steps to reach 1)

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

1,066,338 533,169 1,599,508 799,754 399,877 1,199,632 599,816 299,908 149,954 74,977 224,932 112,466 56,233 168,700 84,350 42,175 126,526 63,263 189,790 94,895 284,686 142,343 427,030 213,515 640,546 320,273 960,820 480,410 240,205 720,616 360,308 180,154 90,077 270,232 135,116 67,558 33,779 101,338 50,669 152,008 76,004 38,002 19,001 57,004 28,502 14,251 42,754 21,377 64,132 32,066 16,033 48,100 24,050 12,025 36,076 18,038 9,019 27,058 13,529 40,588

← Previous Integer #1,066,337 Browse Full Index Next Integer #1,066,339 →