3,463,962

2 × 3 × 577327

3,463,962 factors as 2 × 3 × 577327. Its 8 positive divisors give a proper-divisor sum of 3,463,974, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2 × 3 × 577327

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,927,936

Proper Divisor Sum 3,463,974

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3463939 ← → #3463981

Radix Representation

Decimal	3463962
Binary	1101001101101100011010 (22 bits)
Octal	0o15155432
Hexadecimal	0x34DB1A

Divisor Catalog (8)

1 2 3 6 577,327 1,154,654 1,731,981 3,463,962

Collatz Trajectory (146 steps to reach 1)

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

3,463,962 1,731,981 5,195,944 2,597,972 1,298,986 649,493 1,948,480 974,240 487,120 243,560 121,780 60,890 30,445 91,336 45,668 22,834 11,417 34,252 17,126 8,563 25,690 12,845 38,536 19,268 9,634 4,817 14,452 7,226 3,613 10,840 5,420 2,710 1,355 4,066 2,033 6,100 3,050 1,525 4,576 2,288 1,144 572 286 143 430 215 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103

← Previous Integer #3,463,961 Browse Full Index Next Integer #3,463,963 →