4,091,748

2² × 3 × 340979

4,091,748 factors as 2^2 × 3 × 340979. Its 12 positive divisors give a proper-divisor sum of 5,455,692, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 340979

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,547,440

Proper Divisor Sum 5,455,692

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4091741 ← → #4091749

Radix Representation

Decimal	4091748
Binary	1111100110111101100100 (22 bits)
Octal	0o17467544
Hexadecimal	0x3E6F64

Divisor Catalog (12)

1 2 3 4 6 12 340,979 681,958 1,022,937 1,363,916 2,045,874 4,091,748

Collatz Trajectory (92 steps to reach 1)

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

4,091,748 2,045,874 1,022,937 3,068,812 1,534,406 767,203 2,301,610 1,150,805 3,452,416 1,726,208 863,104 431,552 215,776 107,888 53,944 26,972 13,486 6,743 20,230 10,115 30,346 15,173 45,520 22,760 11,380 5,690 2,845 8,536 4,268 2,134 1,067 3,202 1,601 4,804 2,402 1,201 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,091,747 Browse Full Index Next Integer #4,091,749 →