6,232,956

2² × 3 × 519413

6,232,956 factors as 2^2 × 3 × 519413. Its 12 positive divisors give a proper-divisor sum of 8,310,636, so this integer is abundant. The Collatz stopping time is 165 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 519413

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 14,543,592

Proper Divisor Sum 8,310,636

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6232951 ← → #6232981

Radix Representation

Decimal	6232956
Binary	10111110001101101111100 (23 bits)
Octal	0o27615574
Hexadecimal	0x5F1B7C

Divisor Catalog (12)

1 2 3 4 6 12 519,413 1,038,826 1,558,239 2,077,652 3,116,478 6,232,956

Collatz Trajectory (165 steps to reach 1)

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

6,232,956 3,116,478 1,558,239 4,674,718 2,337,359 7,012,078 3,506,039 10,518,118 5,259,059 15,777,178 7,888,589 23,665,768 11,832,884 5,916,442 2,958,221 8,874,664 4,437,332 2,218,666 1,109,333 3,328,000 1,664,000 832,000 416,000 208,000 104,000 52,000 26,000 13,000 6,500 3,250 1,625 4,876 2,438 1,219 3,658 1,829 5,488 2,744 1,372 686 343 1,030 515 1,546 773 2,320 1,160 580 290 145 436 218 109 328 164 82 41 124 62 31

← Previous Integer #6,232,955 Browse Full Index Next Integer #6,232,957 →