3,127,266

2 × 3² × 71 × 2447

3,127,266 factors as 2 × 3^2 × 71 × 2447. Its 24 positive divisors give a proper-divisor sum of 3,746,718, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 71 × 2447

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 6,873,984

Proper Divisor Sum 3,746,718

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3127259 ← → #3127279

Radix Representation

Decimal	3127266
Binary	1011111011011111100010 (22 bits)
Octal	0o13733742
Hexadecimal	0x2FB7E2

Divisor Catalog (24)

1 2 3 6 9 18 71 142 213 426 639 1,278 2,447 4,894 7,341 14,682 22,023 44,046 173,737 347,474 521,211 1,042,422 1,563,633 3,127,266

Collatz Trajectory (164 steps to reach 1)

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

3,127,266 1,563,633 4,690,900 2,345,450 1,172,725 3,518,176 1,759,088 879,544 439,772 219,886 109,943 329,830 164,915 494,746 247,373 742,120 371,060 185,530 92,765 278,296 139,148 69,574 34,787 104,362 52,181 156,544 78,272 39,136 19,568 9,784 4,892 2,446 1,223 3,670 1,835 5,506 2,753 8,260 4,130 2,065 6,196 3,098 1,549 4,648 2,324 1,162 581 1,744 872 436 218 109 328 164 82 41 124 62 31 94

← Previous Integer #3,127,265 Browse Full Index Next Integer #3,127,267 →