6,451,308

2² × 3² × 179203

6,451,308 factors as 2^2 × 3^2 × 179203. Its 18 positive divisors give a proper-divisor sum of 9,856,256, so this integer is abundant. The Collatz stopping time is 196 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 179203

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 16,307,564

Proper Divisor Sum 9,856,256

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #6451307 ← → #6451321

Radix Representation

Decimal	6451308
Binary	11000100111000001101100 (23 bits)
Octal	0o30470154
Hexadecimal	0x62706C

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 179,203 358,406 537,609 716,812 1,075,218 1,612,827 2,150,436 3,225,654 6,451,308

Collatz Trajectory (196 steps to reach 1)

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

6,451,308 3,225,654 1,612,827 4,838,482 2,419,241 7,257,724 3,628,862 1,814,431 5,443,294 2,721,647 8,164,942 4,082,471 12,247,414 6,123,707 18,371,122 9,185,561 27,556,684 13,778,342 6,889,171 20,667,514 10,333,757 31,001,272 15,500,636 7,750,318 3,875,159 11,625,478 5,812,739 17,438,218 8,719,109 26,157,328 13,078,664 6,539,332 3,269,666 1,634,833 4,904,500 2,452,250 1,226,125 3,678,376 1,839,188 919,594 459,797 1,379,392 689,696 344,848 172,424 86,212 43,106 21,553 64,660 32,330 16,165 48,496 24,248 12,124 6,062 3,031 9,094 4,547 13,642 6,821

← Previous Integer #6,451,307 Browse Full Index Next Integer #6,451,309 →