2,970,968

2³ × 7² × 11 × 13 × 53

2,970,968 factors as 2^3 × 7^2 × 11 × 13 × 53. Its 96 positive divisors give a proper-divisor sum of 4,785,592, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2^3 × 7^2 × 11 × 13 × 53

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 7,756,560

Proper Divisor Sum 4,785,592

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #2970967 ← → #2970977

Radix Representation

Decimal	2970968
Binary	1011010101010101011000 (22 bits)
Octal	0o13252530
Hexadecimal	0x2D5558

Divisor Catalog (60 of 96)

1 2 4 7 8 11 13 14 22 26 28 44 49 52 53 56 77 88 91 98 104 106 143 154 182 196 212 286 308 364 371 392 424 539 572 583 616 637 689 728 742 1,001 1,078 1,144 1,166 1,274 1,378 1,484 2,002 2,156 2,332 2,548 2,597 2,756 2,968 4,004 4,081 4,312 4,664 4,823

Collatz Trajectory (89 steps to reach 1)

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

2,970,968 1,485,484 742,742 371,371 1,114,114 557,057 1,671,172 835,586 417,793 1,253,380 626,690 313,345 940,036 470,018 235,009 705,028 352,514 176,257 528,772 264,386 132,193 396,580 198,290 99,145 297,436 148,718 74,359 223,078 111,539 334,618 167,309 501,928 250,964 125,482 62,741 188,224 94,112 47,056 23,528 11,764 5,882 2,941 8,824 4,412 2,206 1,103 3,310 1,655 4,966 2,483 7,450 3,725 11,176 5,588 2,794 1,397 4,192 2,096 1,048 524

← Previous Integer #2,970,967 Browse Full Index Next Integer #2,970,969 →