9,404,478

2 × 3³ × 174157

9,404,478 factors as 2 × 3^3 × 174157. Its 16 positive divisors give a proper-divisor sum of 11,494,482, so this integer is abundant. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 174157

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 20,898,960

Proper Divisor Sum 11,494,482

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9404443 ← → #9404489

Radix Representation

Decimal	9404478
Binary	100011111000000000111110 (24 bits)
Octal	0o43700076
Hexadecimal	0x8F803E

Divisor Catalog (16)

1 2 3 6 9 18 27 54 174,157 348,314 522,471 1,044,942 1,567,413 3,134,826 4,702,239 9,404,478

Collatz Trajectory (207 steps to reach 1)

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

9,404,478 4,702,239 14,106,718 7,053,359 21,160,078 10,580,039 31,740,118 15,870,059 47,610,178 23,805,089 71,415,268 35,707,634 17,853,817 53,561,452 26,780,726 13,390,363 40,171,090 20,085,545 60,256,636 30,128,318 15,064,159 45,192,478 22,596,239 67,788,718 33,894,359 101,683,078 50,841,539 152,524,618 76,262,309 228,786,928 114,393,464 57,196,732 28,598,366 14,299,183 42,897,550 21,448,775 64,346,326 32,173,163 96,519,490 48,259,745 144,779,236 72,389,618 36,194,809 108,584,428 54,292,214 27,146,107 81,438,322 40,719,161 122,157,484 61,078,742 30,539,371 91,618,114 45,809,057 137,427,172 68,713,586 34,356,793 103,070,380 51,535,190 25,767,595 77,302,786

← Previous Integer #9,404,477 Browse Full Index Next Integer #9,404,479 →