1,107,774

2 × 3² × 61543

1,107,774 factors as 2 × 3^2 × 61543. Its 12 positive divisors give a proper-divisor sum of 1,292,442, so this integer is abundant. The Collatz stopping time is 253 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 61543

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,400,216

Proper Divisor Sum 1,292,442

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1107773 ← → #1107781

Radix Representation

Decimal	1107774
Binary	100001110011100111110 (21 bits)
Octal	0o4163476
Hexadecimal	0x10E73E

Divisor Catalog (12)

1 2 3 6 9 18 61,543 123,086 184,629 369,258 553,887 1,107,774

Collatz Trajectory (253 steps to reach 1)

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

1,107,774 553,887 1,661,662 830,831 2,492,494 1,246,247 3,738,742 1,869,371 5,608,114 2,804,057 8,412,172 4,206,086 2,103,043 6,309,130 3,154,565 9,463,696 4,731,848 2,365,924 1,182,962 591,481 1,774,444 887,222 443,611 1,330,834 665,417 1,996,252 998,126 499,063 1,497,190 748,595 2,245,786 1,122,893 3,368,680 1,684,340 842,170 421,085 1,263,256 631,628 315,814 157,907 473,722 236,861 710,584 355,292 177,646 88,823 266,470 133,235 399,706 199,853 599,560 299,780 149,890 74,945 224,836 112,418 56,209 168,628 84,314 42,157

← Previous Integer #1,107,773 Browse Full Index Next Integer #1,107,775 →