7,452,558

2 × 3² × 414031

7,452,558 factors as 2 × 3^2 × 414031. Its 12 positive divisors give a proper-divisor sum of 8,694,690, so this integer is abundant. The Collatz stopping time is 310 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 414031

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 16,147,248

Proper Divisor Sum 8,694,690

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #7452547 ← → #7452559

Radix Representation

Decimal	7452558
Binary	11100011011011110001110 (23 bits)
Octal	0o34333616
Hexadecimal	0x71B78E

Divisor Catalog (12)

1 2 3 6 9 18 414,031 828,062 1,242,093 2,484,186 3,726,279 7,452,558

Collatz Trajectory (310 steps to reach 1)

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

7,452,558 3,726,279 11,178,838 5,589,419 16,768,258 8,384,129 25,152,388 12,576,194 6,288,097 18,864,292 9,432,146 4,716,073 14,148,220 7,074,110 3,537,055 10,611,166 5,305,583 15,916,750 7,958,375 23,875,126 11,937,563 35,812,690 17,906,345 53,719,036 26,859,518 13,429,759 40,289,278 20,144,639 60,433,918 30,216,959 90,650,878 45,325,439 135,976,318 67,988,159 203,964,478 101,982,239 305,946,718 152,973,359 458,920,078 229,460,039 688,380,118 344,190,059 1,032,570,178 516,285,089 1,548,855,268 774,427,634 387,213,817 1,161,641,452 580,820,726 290,410,363 871,231,090 435,615,545 1,306,846,636 653,423,318 326,711,659 980,134,978 490,067,489 1,470,202,468 735,101,234 367,550,617

← Previous Integer #7,452,557 Browse Full Index Next Integer #7,452,559 →