1,139,412

2² × 3 × 94951

1,139,412 factors as 2^2 × 3 × 94951. Its 12 positive divisors give a proper-divisor sum of 1,519,244, so this integer is abundant. The Collatz stopping time is 77 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 94951

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,658,656

Proper Divisor Sum 1,519,244

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1139407 ← → #1139423

Radix Representation

Decimal	1139412
Binary	100010110001011010100 (21 bits)
Octal	0o4261324
Hexadecimal	0x1162D4

Divisor Catalog (12)

1 2 3 4 6 12 94,951 189,902 284,853 379,804 569,706 1,139,412

Collatz Trajectory (77 steps to reach 1)

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

1,139,412 569,706 284,853 854,560 427,280 213,640 106,820 53,410 26,705 80,116 40,058 20,029 60,088 30,044 15,022 7,511 22,534 11,267 33,802 16,901 50,704 25,352 12,676 6,338 3,169 9,508 4,754 2,377 7,132 3,566 1,783 5,350 2,675 8,026 4,013 12,040 6,020 3,010 1,505 4,516 2,258 1,129 3,388 1,694 847 2,542 1,271 3,814 1,907 5,722 2,861 8,584 4,292 2,146 1,073 3,220 1,610 805 2,416 1,208

More profiles

Browse other published profiles and their separate link collections.

Profile #8,342,168 Profile #1,146,956 Profile #9,712,347 Profile #6,573,969 Profile #965,653 Profile #4,620,983 Profile #853,259 Profile #1,288,150

← Previous Integer #1,139,411 Browse Full Index Next Integer #1,139,413 →