2,683,713

3 × 271 × 3301

2,683,713 factors as 3 × 271 × 3301. Its 8 positive divisors give a proper-divisor sum of 908,863, so this integer is deficient. The Collatz stopping time is 112 steps.

Prime Factor Structure

Factorization String 3 × 271 × 3301

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,592,576

Proper Divisor Sum 908,863

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2683697 ← → #2683717

Radix Representation

Decimal	2683713
Binary	1010001111001101000001 (22 bits)
Octal	0o12171501
Hexadecimal	0x28F341

Divisor Catalog (8)

1 3 271 813 3,301 9,903 894,571 2,683,713

Collatz Trajectory (112 steps to reach 1)

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

2,683,713 8,051,140 4,025,570 2,012,785 6,038,356 3,019,178 1,509,589 4,528,768 2,264,384 1,132,192 566,096 283,048 141,524 70,762 35,381 106,144 53,072 26,536 13,268 6,634 3,317 9,952 4,976 2,488 1,244 622 311 934 467 1,402 701 2,104 1,052 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754 377 1,132 566 283 850 425 1,276 638 319 958 479

← Previous Integer #2,683,712 Browse Full Index Next Integer #2,683,714 →