8,074,338

2 × 3 × 53 × 25391

8,074,338 factors as 2 × 3 × 53 × 25391. Its 16 positive divisors give a proper-divisor sum of 8,379,678, so this integer is abundant. The Collatz stopping time is 137 steps.

Prime Factor Structure

Factorization String 2 × 3 × 53 × 25391

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 16,454,016

Proper Divisor Sum 8,379,678

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #8074309 ← → #8074349

Radix Representation

Decimal	8074338
Binary	11110110011010001100010 (23 bits)
Octal	0o36632142
Hexadecimal	0x7B3462

Divisor Catalog (16)

1 2 3 6 53 106 159 318 25,391 50,782 76,173 152,346 1,345,723 2,691,446 4,037,169 8,074,338

Collatz Trajectory (137 steps to reach 1)

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

8,074,338 4,037,169 12,111,508 6,055,754 3,027,877 9,083,632 4,541,816 2,270,908 1,135,454 567,727 1,703,182 851,591 2,554,774 1,277,387 3,832,162 1,916,081 5,748,244 2,874,122 1,437,061 4,311,184 2,155,592 1,077,796 538,898 269,449 808,348 404,174 202,087 606,262 303,131 909,394 454,697 1,364,092 682,046 341,023 1,023,070 511,535 1,534,606 767,303 2,301,910 1,150,955 3,452,866 1,726,433 5,179,300 2,589,650 1,294,825 3,884,476 1,942,238 971,119 2,913,358 1,456,679 4,370,038 2,185,019 6,555,058 3,277,529 9,832,588 4,916,294 2,458,147 7,374,442 3,687,221 11,061,664

← Previous Integer #8,074,337 Browse Full Index Next Integer #8,074,339 →