3,680,072

2³ × 11 × 19 × 31 × 71

3,680,072 factors as 2^3 × 11 × 19 × 31 × 71. Its 64 positive divisors give a proper-divisor sum of 4,614,328, so this integer is abundant. The Collatz stopping time is 159 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 19 × 31 × 71

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 8,294,400

Proper Divisor Sum 4,614,328

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #3680059 ← → #3680081

Radix Representation

Decimal	3680072
Binary	1110000010011101001000 (22 bits)
Octal	0o16023510
Hexadecimal	0x382748

Divisor Catalog (60 of 64)

1 2 4 8 11 19 22 31 38 44 62 71 76 88 124 142 152 209 248 284 341 418 568 589 682 781 836 1,178 1,349 1,364 1,562 1,672 2,201 2,356 2,698 2,728 3,124 4,402 4,712 5,396 6,248 6,479 8,804 10,792 12,958 14,839 17,608 24,211 25,916 29,678 41,819 48,422 51,832 59,356 83,638 96,844 118,712 167,276 193,688 334,552

Collatz Trajectory (159 steps to reach 1)

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

3,680,072 1,840,036 920,018 460,009 1,380,028 690,014 345,007 1,035,022 517,511 1,552,534 776,267 2,328,802 1,164,401 3,493,204 1,746,602 873,301 2,619,904 1,309,952 654,976 327,488 163,744 81,872 40,936 20,468 10,234 5,117 15,352 7,676 3,838 1,919 5,758 2,879 8,638 4,319 12,958 6,479 19,438 9,719 29,158 14,579 43,738 21,869 65,608 32,804 16,402 8,201 24,604 12,302 6,151 18,454 9,227 27,682 13,841 41,524 20,762 10,381 31,144 15,572 7,786 3,893

← Previous Integer #3,680,071 Browse Full Index Next Integer #3,680,073 →