4,340,526

2 × 3 × 723421

4,340,526 factors as 2 × 3 × 723421. Its 8 positive divisors give a proper-divisor sum of 4,340,538, so this integer is abundant. The Collatz stopping time is 273 steps.

Prime Factor Structure

Factorization String 2 × 3 × 723421

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,681,064

Proper Divisor Sum 4,340,538

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4340521 ← → #4340533

Radix Representation

Decimal	4340526
Binary	10000100011101100101110 (23 bits)
Octal	0o20435456
Hexadecimal	0x423B2E

Divisor Catalog (8)

1 2 3 6 723,421 1,446,842 2,170,263 4,340,526

Collatz Trajectory (273 steps to reach 1)

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

4,340,526 2,170,263 6,510,790 3,255,395 9,766,186 4,883,093 14,649,280 7,324,640 3,662,320 1,831,160 915,580 457,790 228,895 686,686 343,343 1,030,030 515,015 1,545,046 772,523 2,317,570 1,158,785 3,476,356 1,738,178 869,089 2,607,268 1,303,634 651,817 1,955,452 977,726 488,863 1,466,590 733,295 2,199,886 1,099,943 3,299,830 1,649,915 4,949,746 2,474,873 7,424,620 3,712,310 1,856,155 5,568,466 2,784,233 8,352,700 4,176,350 2,088,175 6,264,526 3,132,263 9,396,790 4,698,395 14,095,186 7,047,593 21,142,780 10,571,390 5,285,695 15,857,086 7,928,543 23,785,630 11,892,815 35,678,446

← Previous Integer #4,340,525 Browse Full Index Next Integer #4,340,527 →