4,134,834

2 × 3³ × 11 × 6961

4,134,834 factors as 2 × 3^3 × 11 × 6961. Its 32 positive divisors give a proper-divisor sum of 5,890,446, so this integer is abundant. The Collatz stopping time is 79 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 11 × 6961

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,025,280

Proper Divisor Sum 5,890,446

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4134829 ← → #4134847

Radix Representation

Decimal	4134834
Binary	1111110001011110110010 (22 bits)
Octal	0o17613662
Hexadecimal	0x3F17B2

Divisor Catalog (32)

Collatz Trajectory (79 steps to reach 1)

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

4,134,834 2,067,417 6,202,252 3,101,126 1,550,563 4,651,690 2,325,845 6,977,536 3,488,768 1,744,384 872,192 436,096 218,048 109,024 54,512 27,256 13,628 6,814 3,407 10,222 5,111 15,334 7,667 23,002 11,501 34,504 17,252 8,626 4,313 12,940 6,470 3,235 9,706 4,853 14,560 7,280 3,640 1,820 910 455 1,366 683 2,050 1,025 3,076 1,538 769 2,308 1,154 577 1,732 866 433 1,300 650 325 976 488 244 122

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,134,833 Browse Full Index Next Integer #4,134,835 →