8,308,074

2 × 3 × 1384679

8,308,074 factors as 2 × 3 × 1384679. Its 8 positive divisors give a proper-divisor sum of 8,308,086, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1384679

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 16,616,160

Proper Divisor Sum 8,308,086

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #8308063 ← → #8308103

Radix Representation

Decimal	8308074
Binary	11111101100010101101010 (23 bits)
Octal	0o37542552
Hexadecimal	0x7EC56A

Divisor Catalog (8)

1 2 3 6 1,384,679 2,769,358 4,154,037 8,308,074

Collatz Trajectory (168 steps to reach 1)

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

8,308,074 4,154,037 12,462,112 6,231,056 3,115,528 1,557,764 778,882 389,441 1,168,324 584,162 292,081 876,244 438,122 219,061 657,184 328,592 164,296 82,148 41,074 20,537 61,612 30,806 15,403 46,210 23,105 69,316 34,658 17,329 51,988 25,994 12,997 38,992 19,496 9,748 4,874 2,437 7,312 3,656 1,828 914 457 1,372 686 343 1,030 515 1,546 773 2,320 1,160 580 290 145 436 218 109 328 164 82 41

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,308,073 Browse Full Index Next Integer #8,308,075 →