3,966,566

2 × 263 × 7541

3,966,566 factors as 2 × 263 × 7541. Its 8 positive divisors give a proper-divisor sum of 2,006,698, so this integer is deficient. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2 × 263 × 7541

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,973,264

Proper Divisor Sum 2,006,698

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #3966563 ← → #3966581

Radix Representation

Decimal	3966566
Binary	1111001000011001100110 (22 bits)
Octal	0o17103146
Hexadecimal	0x3C8666

Divisor Catalog (8)

1 2 263 526 7,541 15,082 1,983,283 3,966,566

Collatz Trajectory (123 steps to reach 1)

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

3,966,566 1,983,283 5,949,850 2,974,925 8,924,776 4,462,388 2,231,194 1,115,597 3,346,792 1,673,396 836,698 418,349 1,255,048 627,524 313,762 156,881 470,644 235,322 117,661 352,984 176,492 88,246 44,123 132,370 66,185 198,556 99,278 49,639 148,918 74,459 223,378 111,689 335,068 167,534 83,767 251,302 125,651 376,954 188,477 565,432 282,716 141,358 70,679 212,038 106,019 318,058 159,029 477,088 238,544 119,272 59,636 29,818 14,909 44,728 22,364 11,182 5,591 16,774 8,387 25,162

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,966,565 Browse Full Index Next Integer #3,966,567 →