4,020,946

2 × 563 × 3571

4,020,946 factors as 2 × 563 × 3571. Its 8 positive divisors give a proper-divisor sum of 2,022,878, so this integer is deficient. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2 × 563 × 3571

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,043,824

Proper Divisor Sum 2,022,878

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #4020923 ← → #4020949

Radix Representation

Decimal	4020946
Binary	1111010101101011010010 (22 bits)
Octal	0o17255322
Hexadecimal	0x3D5AD2

Divisor Catalog (8)

1 2 563 1,126 3,571 7,142 2,010,473 4,020,946

Collatz Trajectory (141 steps to reach 1)

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

4,020,946 2,010,473 6,031,420 3,015,710 1,507,855 4,523,566 2,261,783 6,785,350 3,392,675 10,178,026 5,089,013 15,267,040 7,633,520 3,816,760 1,908,380 954,190 477,095 1,431,286 715,643 2,146,930 1,073,465 3,220,396 1,610,198 805,099 2,415,298 1,207,649 3,622,948 1,811,474 905,737 2,717,212 1,358,606 679,303 2,037,910 1,018,955 3,056,866 1,528,433 4,585,300 2,292,650 1,146,325 3,438,976 1,719,488 859,744 429,872 214,936 107,468 53,734 26,867 80,602 40,301 120,904 60,452 30,226 15,113 45,340 22,670 11,335 34,006 17,003 51,010 25,505

← Previous Integer #4,020,945 Browse Full Index Next Integer #4,020,947 →