9,407,628

2² × 3² × 261323

9,407,628 factors as 2^2 × 3^2 × 261323. Its 18 positive divisors give a proper-divisor sum of 14,372,856, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 261323

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 23,780,484

Proper Divisor Sum 14,372,856

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9407623 ← → #9407633

Radix Representation

Decimal	9407628
Binary	100011111000110010001100 (24 bits)
Octal	0o43706214
Hexadecimal	0x8F8C8C

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 261,323 522,646 783,969 1,045,292 1,567,938 2,351,907 3,135,876 4,703,814 9,407,628

Collatz Trajectory (194 steps to reach 1)

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

9,407,628 4,703,814 2,351,907 7,055,722 3,527,861 10,583,584 5,291,792 2,645,896 1,322,948 661,474 330,737 992,212 496,106 248,053 744,160 372,080 186,040 93,020 46,510 23,255 69,766 34,883 104,650 52,325 156,976 78,488 39,244 19,622 9,811 29,434 14,717 44,152 22,076 11,038 5,519 16,558 8,279 24,838 12,419 37,258 18,629 55,888 27,944 13,972 6,986 3,493 10,480 5,240 2,620 1,310 655 1,966 983 2,950 1,475 4,426 2,213 6,640 3,320 1,660

← Previous Integer #9,407,627 Browse Full Index Next Integer #9,407,629 →