938,322

2 × 3² × 7 × 11 × 677

938,322 factors as 2 × 3^2 × 7 × 11 × 677. Its 48 positive divisors give a proper-divisor sum of 1,600,110, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 7 × 11 × 677

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 2,538,432

Proper Divisor Sum 1,600,110

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #938309 ← → #938323

Radix Representation

Decimal	938322
Binary	11100101000101010010 (20 bits)
Octal	0o3450522
Hexadecimal	0xE5152

Divisor Catalog (48)

1 2 3 6 7 9 11 14 18 21 22 33 42 63 66 77 99 126 154 198 231 462 677 693 1,354 1,386 2,031 4,062 4,739 6,093 7,447 9,478 12,186 14,217 14,894 22,341 28,434 42,651 44,682 52,129 67,023 85,302 104,258 134,046 156,387 312,774 469,161 938,322

Collatz Trajectory (139 steps to reach 1)

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

938,322 469,161 1,407,484 703,742 351,871 1,055,614 527,807 1,583,422 791,711 2,375,134 1,187,567 3,562,702 1,781,351 5,344,054 2,672,027 8,016,082 4,008,041 12,024,124 6,012,062 3,006,031 9,018,094 4,509,047 13,527,142 6,763,571 20,290,714 10,145,357 30,436,072 15,218,036 7,609,018 3,804,509 11,413,528 5,706,764 2,853,382 1,426,691 4,280,074 2,140,037 6,420,112 3,210,056 1,605,028 802,514 401,257 1,203,772 601,886 300,943 902,830 451,415 1,354,246 677,123 2,031,370 1,015,685 3,047,056 1,523,528 761,764 380,882 190,441 571,324 285,662 142,831 428,494 214,247

← Previous Integer #938,321 Browse Full Index Next Integer #938,323 →