4,232,658

2 × 3 × 67 × 10529

4,232,658 factors as 2 × 3 × 67 × 10529. Its 16 positive divisors give a proper-divisor sum of 4,359,822, so this integer is abundant. The Collatz stopping time is 273 steps.

Prime Factor Structure

Factorization String 2 × 3 × 67 × 10529

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,592,480

Proper Divisor Sum 4,359,822

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4232653 ← → #4232659

Radix Representation

Decimal	4232658
Binary	10000001001010111010010 (23 bits)
Octal	0o20112722
Hexadecimal	0x4095D2

Divisor Catalog (16)

1 2 3 6 67 134 201 402 10,529 21,058 31,587 63,174 705,443 1,410,886 2,116,329 4,232,658

Collatz Trajectory (273 steps to reach 1)

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

4,232,658 2,116,329 6,348,988 3,174,494 1,587,247 4,761,742 2,380,871 7,142,614 3,571,307 10,713,922 5,356,961 16,070,884 8,035,442 4,017,721 12,053,164 6,026,582 3,013,291 9,039,874 4,519,937 13,559,812 6,779,906 3,389,953 10,169,860 5,084,930 2,542,465 7,627,396 3,813,698 1,906,849 5,720,548 2,860,274 1,430,137 4,290,412 2,145,206 1,072,603 3,217,810 1,608,905 4,826,716 2,413,358 1,206,679 3,620,038 1,810,019 5,430,058 2,715,029 8,145,088 4,072,544 2,036,272 1,018,136 509,068 254,534 127,267 381,802 190,901 572,704 286,352 143,176 71,588 35,794 17,897 53,692 26,846

← Previous Integer #4,232,657 Browse Full Index Next Integer #4,232,659 →