1,071,678

2 × 3 × 178613

1,071,678 factors as 2 × 3 × 178613. Its 8 positive divisors give a proper-divisor sum of 1,071,690, so this integer is abundant. The Collatz stopping time is 72 steps.

Prime Factor Structure

Factorization String 2 × 3 × 178613

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,143,368

Proper Divisor Sum 1,071,690

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1071671 ← → #1071683

Radix Representation

Decimal	1071678
Binary	100000101101000111110 (21 bits)
Octal	0o4055076
Hexadecimal	0x105A3E

Divisor Catalog (8)

1 2 3 6 178,613 357,226 535,839 1,071,678

Collatz Trajectory (72 steps to reach 1)

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

1,071,678 535,839 1,607,518 803,759 2,411,278 1,205,639 3,616,918 1,808,459 5,425,378 2,712,689 8,138,068 4,069,034 2,034,517 6,103,552 3,051,776 1,525,888 762,944 381,472 190,736 95,368 47,684 23,842 11,921 35,764 17,882 8,941 26,824 13,412 6,706 3,353 10,060 5,030 2,515 7,546 3,773 11,320 5,660 2,830 1,415 4,246 2,123 6,370 3,185 9,556 4,778 2,389 7,168 3,584 1,792 896 448 224 112 56 28 14 7 22 11 34

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,071,677 Browse Full Index Next Integer #1,071,679 →