4,086,147

3 × 13 × 104773

4,086,147 factors as 3 × 13 × 104773. Its 8 positive divisors give a proper-divisor sum of 1,781,197, so this integer is deficient. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 3 × 13 × 104773

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,867,344

Proper Divisor Sum 1,781,197

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4086143 ← → #4086149

Radix Representation

Decimal	4086147
Binary	1111100101100110000011 (22 bits)
Octal	0o17454603
Hexadecimal	0x3E5983

Divisor Catalog (8)

1 3 13 39 104,773 314,319 1,362,049 4,086,147

Collatz Trajectory (105 steps to reach 1)

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

4,086,147 12,258,442 6,129,221 18,387,664 9,193,832 4,596,916 2,298,458 1,149,229 3,447,688 1,723,844 861,922 430,961 1,292,884 646,442 323,221 969,664 484,832 242,416 121,208 60,604 30,302 15,151 45,454 22,727 68,182 34,091 102,274 51,137 153,412 76,706 38,353 115,060 57,530 28,765 86,296 43,148 21,574 10,787 32,362 16,181 48,544 24,272 12,136 6,068 3,034 1,517 4,552 2,276 1,138 569 1,708 854 427 1,282 641 1,924 962 481 1,444 722

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,086,146 Browse Full Index Next Integer #4,086,148 →