8,103,706

2 × 13 × 311681

8,103,706 factors as 2 × 13 × 311681. Its 8 positive divisors give a proper-divisor sum of 4,986,938, so this integer is deficient. The Collatz stopping time is 111 steps.

Prime Factor Structure

Factorization String 2 × 13 × 311681

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,090,644

Proper Divisor Sum 4,986,938

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #8103661 ← → #8103721

Radix Representation

Decimal	8103706
Binary	11110111010011100011010 (23 bits)
Octal	0o36723432
Hexadecimal	0x7BA71A

Divisor Catalog (8)

1 2 13 26 311,681 623,362 4,051,853 8,103,706

Collatz Trajectory (111 steps to reach 1)

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

8,103,706 4,051,853 12,155,560 6,077,780 3,038,890 1,519,445 4,558,336 2,279,168 1,139,584 569,792 284,896 142,448 71,224 35,612 17,806 8,903 26,710 13,355 40,066 20,033 60,100 30,050 15,025 45,076 22,538 11,269 33,808 16,904 8,452 4,226 2,113 6,340 3,170 1,585 4,756 2,378 1,189 3,568 1,784 892 446 223 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700 850 425 1,276 638 319 958 479 1,438

← Previous Integer #8,103,705 Browse Full Index Next Integer #8,103,707 →