306,522

2 × 3² × 17029

306,522 factors as 2 × 3^2 × 17029. Its 12 positive divisors give a proper-divisor sum of 357,648, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 17029

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 664,170

Proper Divisor Sum 357,648

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #306517 ← → #306529

Radix Representation

Decimal	306522
Binary	1001010110101011010 (19 bits)
Octal	0o1126532
Hexadecimal	0x4AD5A

Divisor Catalog (12)

1 2 3 6 9 18 17,029 34,058 51,087 102,174 153,261 306,522

Collatz Trajectory (96 steps to reach 1)

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

306,522 153,261 459,784 229,892 114,946 57,473 172,420 86,210 43,105 129,316 64,658 32,329 96,988 48,494 24,247 72,742 36,371 109,114 54,557 163,672 81,836 40,918 20,459 61,378 30,689 92,068 46,034 23,017 69,052 34,526 17,263 51,790 25,895 77,686 38,843 116,530 58,265 174,796 87,398 43,699 131,098 65,549 196,648 98,324 49,162 24,581 73,744 36,872 18,436 9,218 4,609 13,828 6,914 3,457 10,372 5,186 2,593 7,780 3,890 1,945

← Previous Integer #306,521 Browse Full Index Next Integer #306,523 →