5,970,258

2 × 3² × 7³ × 967

5,970,258 factors as 2 × 3^2 × 7^3 × 967. Its 48 positive divisors give a proper-divisor sum of 9,130,542, so this integer is abundant. The Collatz stopping time is 227 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 7^3 × 967

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 15,100,800

Proper Divisor Sum 9,130,542

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5970241 ← → #5970277

Radix Representation

Decimal	5970258
Binary	10110110001100101010010 (23 bits)
Octal	0o26614522
Hexadecimal	0x5B1952

Divisor Catalog (48)

1 2 3 6 7 9 14 18 21 42 49 63 98 126 147 294 343 441 686 882 967 1,029 1,934 2,058 2,901 3,087 5,802 6,174 6,769 8,703 13,538 17,406 20,307 40,614 47,383 60,921 94,766 121,842 142,149 284,298 331,681 426,447 663,362 852,894 995,043 1,990,086 2,985,129 5,970,258

Collatz Trajectory (227 steps to reach 1)

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

5,970,258 2,985,129 8,955,388 4,477,694 2,238,847 6,716,542 3,358,271 10,074,814 5,037,407 15,112,222 7,556,111 22,668,334 11,334,167 34,002,502 17,001,251 51,003,754 25,501,877 76,505,632 38,252,816 19,126,408 9,563,204 4,781,602 2,390,801 7,172,404 3,586,202 1,793,101 5,379,304 2,689,652 1,344,826 672,413 2,017,240 1,008,620 504,310 252,155 756,466 378,233 1,134,700 567,350 283,675 851,026 425,513 1,276,540 638,270 319,135 957,406 478,703 1,436,110 718,055 2,154,166 1,077,083 3,231,250 1,615,625 4,846,876 2,423,438 1,211,719 3,635,158 1,817,579 5,452,738 2,726,369 8,179,108

← Previous Integer #5,970,257 Browse Full Index Next Integer #5,970,259 →