6,962,448

2⁴ × 3 × 73 × 1987

6,962,448 factors as 2^4 × 3 × 73 × 1987. Its 40 positive divisors give a proper-divisor sum of 11,279,440, so this integer is abundant. The Collatz stopping time is 222 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 73 × 1987

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 18,241,888

Proper Divisor Sum 11,279,440

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6962447 ← → #6962467

Radix Representation

Decimal	6962448
Binary	11010100011110100010000 (23 bits)
Octal	0o32436420
Hexadecimal	0x6A3D10

Divisor Catalog (40)

1 2 3 4 6 8 12 16 24 48 73 146 219 292 438 584 876 1,168 1,752 1,987 3,504 3,974 5,961 7,948 11,922 15,896 23,844 31,792 47,688 95,376 145,051 290,102 435,153 580,204 870,306 1,160,408 1,740,612 2,320,816 3,481,224 6,962,448

Collatz Trajectory (222 steps to reach 1)

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

6,962,448 3,481,224 1,740,612 870,306 435,153 1,305,460 652,730 326,365 979,096 489,548 244,774 122,387 367,162 183,581 550,744 275,372 137,686 68,843 206,530 103,265 309,796 154,898 77,449 232,348 116,174 58,087 174,262 87,131 261,394 130,697 392,092 196,046 98,023 294,070 147,035 441,106 220,553 661,660 330,830 165,415 496,246 248,123 744,370 372,185 1,116,556 558,278 279,139 837,418 418,709 1,256,128 628,064 314,032 157,016 78,508 39,254 19,627 58,882 29,441 88,324 44,162

← Previous Integer #6,962,447 Browse Full Index Next Integer #6,962,449 →