1,127,652

2² × 3 × 93971

1,127,652 factors as 2^2 × 3 × 93971. Its 12 positive divisors give a proper-divisor sum of 1,503,564, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 93971

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,631,216

Proper Divisor Sum 1,503,564

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1127641 ← → #1127657

Radix Representation

Decimal	1127652
Binary	100010011010011100100 (21 bits)
Octal	0o4232344
Hexadecimal	0x1134E4

Divisor Catalog (12)

1 2 3 4 6 12 93,971 187,942 281,913 375,884 563,826 1,127,652

Collatz Trajectory (108 steps to reach 1)

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

1,127,652 563,826 281,913 845,740 422,870 211,435 634,306 317,153 951,460 475,730 237,865 713,596 356,798 178,399 535,198 267,599 802,798 401,399 1,204,198 602,099 1,806,298 903,149 2,709,448 1,354,724 677,362 338,681 1,016,044 508,022 254,011 762,034 381,017 1,143,052 571,526 285,763 857,290 428,645 1,285,936 642,968 321,484 160,742 80,371 241,114 120,557 361,672 180,836 90,418 45,209 135,628 67,814 33,907 101,722 50,861 152,584 76,292 38,146 19,073 57,220 28,610 14,305 42,916

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,127,651 Browse Full Index Next Integer #1,127,653 →