3,886,038

2 × 3² × 13 × 16607

3,886,038 factors as 2 × 3^2 × 13 × 16607. Its 24 positive divisors give a proper-divisor sum of 5,181,930, so this integer is abundant. The Collatz stopping time is 278 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 13 × 16607

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 9,067,968

Proper Divisor Sum 5,181,930

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3886037 ← → #3886049

Radix Representation

Decimal	3886038
Binary	1110110100101111010110 (22 bits)
Octal	0o16645726
Hexadecimal	0x3B4BD6

Divisor Catalog (24)

1 2 3 6 9 13 18 26 39 78 117 234 16,607 33,214 49,821 99,642 149,463 215,891 298,926 431,782 647,673 1,295,346 1,943,019 3,886,038

Collatz Trajectory (278 steps to reach 1)

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

3,886,038 1,943,019 5,829,058 2,914,529 8,743,588 4,371,794 2,185,897 6,557,692 3,278,846 1,639,423 4,918,270 2,459,135 7,377,406 3,688,703 11,066,110 5,533,055 16,599,166 8,299,583 24,898,750 12,449,375 37,348,126 18,674,063 56,022,190 28,011,095 84,033,286 42,016,643 126,049,930 63,024,965 189,074,896 94,537,448 47,268,724 23,634,362 11,817,181 35,451,544 17,725,772 8,862,886 4,431,443 13,294,330 6,647,165 19,941,496 9,970,748 4,985,374 2,492,687 7,478,062 3,739,031 11,217,094 5,608,547 16,825,642 8,412,821 25,238,464 12,619,232 6,309,616 3,154,808 1,577,404 788,702 394,351 1,183,054 591,527 1,774,582 887,291

← Previous Integer #3,886,037 Browse Full Index Next Integer #3,886,039 →