3,406,540

2² × 5 × 170327

3,406,540 factors as 2^2 × 5 × 170327. Its 12 positive divisors give a proper-divisor sum of 3,747,236, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 170327

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,153,776

Proper Divisor Sum 3,747,236

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #3406531 ← → #3406541

Radix Representation

Decimal	3406540
Binary	1100111111101011001100 (22 bits)
Octal	0o14775314
Hexadecimal	0x33FACC

Divisor Catalog (12)

1 2 4 5 10 20 170,327 340,654 681,308 851,635 1,703,270 3,406,540

Collatz Trajectory (84 steps to reach 1)

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

3,406,540 1,703,270 851,635 2,554,906 1,277,453 3,832,360 1,916,180 958,090 479,045 1,437,136 718,568 359,284 179,642 89,821 269,464 134,732 67,366 33,683 101,050 50,525 151,576 75,788 37,894 18,947 56,842 28,421 85,264 42,632 21,316 10,658 5,329 15,988 7,994 3,997 11,992 5,996 2,998 1,499 4,498 2,249 6,748 3,374 1,687 5,062 2,531 7,594 3,797 11,392 5,696 2,848 1,424 712 356 178 89 268 134 67 202 101

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,406,539 Browse Full Index Next Integer #3,406,541 →