3,134,634

2 × 3 × 522439

3,134,634 factors as 2 × 3 × 522439. Its 8 positive divisors give a proper-divisor sum of 3,134,646, so this integer is abundant. The Collatz stopping time is 133 steps.

Prime Factor Structure

Factorization String 2 × 3 × 522439

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,269,280

Proper Divisor Sum 3,134,646

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3134633 ← → #3134671

Radix Representation

Decimal	3134634
Binary	1011111101010010101010 (22 bits)
Octal	0o13752252
Hexadecimal	0x2FD4AA

Divisor Catalog (8)

1 2 3 6 522,439 1,044,878 1,567,317 3,134,634

Collatz Trajectory (133 steps to reach 1)

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

3,134,634 1,567,317 4,701,952 2,350,976 1,175,488 587,744 293,872 146,936 73,468 36,734 18,367 55,102 27,551 82,654 41,327 123,982 61,991 185,974 92,987 278,962 139,481 418,444 209,222 104,611 313,834 156,917 470,752 235,376 117,688 58,844 29,422 14,711 44,134 22,067 66,202 33,101 99,304 49,652 24,826 12,413 37,240 18,620 9,310 4,655 13,966 6,983 20,950 10,475 31,426 15,713 47,140 23,570 11,785 35,356 17,678 8,839 26,518 13,259 39,778 19,889

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,134,633 Browse Full Index Next Integer #3,134,635 →