230,106

2 × 3 × 38351

230,106 factors as 2 × 3 × 38351. Its 8 positive divisors give a proper-divisor sum of 230,118, so this integer is abundant. The Collatz stopping time is 199 steps.

Prime Factor Structure

Factorization String 2 × 3 × 38351

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 460,224

Proper Divisor Sum 230,118

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #230101 ← → #230107

Radix Representation

Decimal	230106
Binary	111000001011011010 (18 bits)
Octal	0o701332
Hexadecimal	0x382DA

Divisor Catalog (8)

1 2 3 6 38,351 76,702 115,053 230,106

Collatz Trajectory (199 steps to reach 1)

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

230,106 115,053 345,160 172,580 86,290 43,145 129,436 64,718 32,359 97,078 48,539 145,618 72,809 218,428 109,214 54,607 163,822 81,911 245,734 122,867 368,602 184,301 552,904 276,452 138,226 69,113 207,340 103,670 51,835 155,506 77,753 233,260 116,630 58,315 174,946 87,473 262,420 131,210 65,605 196,816 98,408 49,204 24,602 12,301 36,904 18,452 9,226 4,613 13,840 6,920 3,460 1,730 865 2,596 1,298 649 1,948 974 487 1,462

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #230,105 Browse Full Index Next Integer #230,107 →