3,462,186

2 × 3 × 7 × 13 × 17 × 373

3,462,186 factors as 2 × 3 × 7 × 13 × 17 × 373. Its 64 positive divisors give a proper-divisor sum of 5,585,622, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 13 × 17 × 373

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 9,047,808

Proper Divisor Sum 5,585,622

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3462181 ← → #3462187

Radix Representation

Decimal	3462186
Binary	1101001101010000101010 (22 bits)
Octal	0o15152052
Hexadecimal	0x34D42A

Divisor Catalog (60 of 64)

1 2 3 6 7 13 14 17 21 26 34 39 42 51 78 91 102 119 182 221 238 273 357 373 442 546 663 714 746 1,119 1,326 1,547 2,238 2,611 3,094 4,641 4,849 5,222 6,341 7,833 9,282 9,698 12,682 14,547 15,666 19,023 29,094 33,943 38,046 44,387 67,886 82,433 88,774 101,829 133,161 164,866 203,658 247,299 266,322 494,598

Collatz Trajectory (84 steps to reach 1)

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

3,462,186 1,731,093 5,193,280 2,596,640 1,298,320 649,160 324,580 162,290 81,145 243,436 121,718 60,859 182,578 91,289 273,868 136,934 68,467 205,402 102,701 308,104 154,052 77,026 38,513 115,540 57,770 28,885 86,656 43,328 21,664 10,832 5,416 2,708 1,354 677 2,032 1,016 508 254 127 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640 820 410 205 616

← Previous Integer #3,462,185 Browse Full Index Next Integer #3,462,187 →