4,133,958

2 × 3 × 17 × 40529

4,133,958 factors as 2 × 3 × 17 × 40529. Its 16 positive divisors give a proper-divisor sum of 4,620,522, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 40529

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,754,480

Proper Divisor Sum 4,620,522

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4133957 ← → #4133971

Radix Representation

Decimal	4133958
Binary	1111110001010001000110 (22 bits)
Octal	0o17612106
Hexadecimal	0x3F1446

Divisor Catalog (16)

1 2 3 6 17 34 51 102 40,529 81,058 121,587 243,174 688,993 1,377,986 2,066,979 4,133,958

Collatz Trajectory (167 steps to reach 1)

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

4,133,958 2,066,979 6,200,938 3,100,469 9,301,408 4,650,704 2,325,352 1,162,676 581,338 290,669 872,008 436,004 218,002 109,001 327,004 163,502 81,751 245,254 122,627 367,882 183,941 551,824 275,912 137,956 68,978 34,489 103,468 51,734 25,867 77,602 38,801 116,404 58,202 29,101 87,304 43,652 21,826 10,913 32,740 16,370 8,185 24,556 12,278 6,139 18,418 9,209 27,628 13,814 6,907 20,722 10,361 31,084 15,542 7,771 23,314 11,657 34,972 17,486 8,743 26,230

← Previous Integer #4,133,957 Browse Full Index Next Integer #4,133,959 →