4,203,602

2 × 13 × 107 × 1511

4,203,602 factors as 2 × 13 × 107 × 1511. Its 16 positive divisors give a proper-divisor sum of 2,654,830, so this integer is deficient. The Collatz stopping time is 273 steps.

Prime Factor Structure

Factorization String 2 × 13 × 107 × 1511

Distinct Prime Factors 4

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,858,432

Proper Divisor Sum 2,654,830

Digit Sum / Digital Root 17 (Root: 8)

Adjacent Primes #4203601 ← → #4203611

Radix Representation

Decimal	4203602
Binary	10000000010010001010010 (23 bits)
Octal	0o20022122
Hexadecimal	0x402452

Divisor Catalog (16)

1 2 13 26 107 214 1,391 1,511 2,782 3,022 19,643 39,286 161,677 323,354 2,101,801 4,203,602

Collatz Trajectory (273 steps to reach 1)

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

4,203,602 2,101,801 6,305,404 3,152,702 1,576,351 4,729,054 2,364,527 7,093,582 3,546,791 10,640,374 5,320,187 15,960,562 7,980,281 23,940,844 11,970,422 5,985,211 17,955,634 8,977,817 26,933,452 13,466,726 6,733,363 20,200,090 10,100,045 30,300,136 15,150,068 7,575,034 3,787,517 11,362,552 5,681,276 2,840,638 1,420,319 4,260,958 2,130,479 6,391,438 3,195,719 9,587,158 4,793,579 14,380,738 7,190,369 21,571,108 10,785,554 5,392,777 16,178,332 8,089,166 4,044,583 12,133,750 6,066,875 18,200,626 9,100,313 27,300,940 13,650,470 6,825,235 20,475,706 10,237,853 30,713,560 15,356,780 7,678,390 3,839,195 11,517,586 5,758,793

← Previous Integer #4,203,601 Browse Full Index Next Integer #4,203,603 →