306,006

2 × 3 × 51001

306,006 factors as 2 × 3 × 51001. Its 8 positive divisors give a proper-divisor sum of 306,018, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2 × 3 × 51001

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 612,024

Proper Divisor Sum 306,018

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #305999 ← → #306011

Radix Representation

Decimal	306006
Binary	1001010101101010110 (19 bits)
Octal	0o1125526
Hexadecimal	0x4AB56

Divisor Catalog (8)

1 2 3 6 51,001 102,002 153,003 306,006

Collatz Trajectory (96 steps to reach 1)

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

306,006 153,003 459,010 229,505 688,516 344,258 172,129 516,388 258,194 129,097 387,292 193,646 96,823 290,470 145,235 435,706 217,853 653,560 326,780 163,390 81,695 245,086 122,543 367,630 183,815 551,446 275,723 827,170 413,585 1,240,756 620,378 310,189 930,568 465,284 232,642 116,321 348,964 174,482 87,241 261,724 130,862 65,431 196,294 98,147 294,442 147,221 441,664 220,832 110,416 55,208 27,604 13,802 6,901 20,704 10,352 5,176 2,588 1,294 647 1,942

← Previous Integer #306,005 Browse Full Index Next Integer #306,007 →