298,902

2 × 3 × 31 × 1607

298,902 factors as 2 × 3 × 31 × 1607. Its 16 positive divisors give a proper-divisor sum of 318,570, so this integer is abundant. The Collatz stopping time is 158 steps.

Prime Factor Structure

Factorization String 2 × 3 × 31 × 1607

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 617,472

Proper Divisor Sum 318,570

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #298897 ← → #298937

Radix Representation

Decimal	298902
Binary	1001000111110010110 (19 bits)
Octal	0o1107626
Hexadecimal	0x48F96

Divisor Catalog (16)

1 2 3 6 31 62 93 186 1,607 3,214 4,821 9,642 49,817 99,634 149,451 298,902

Collatz Trajectory (158 steps to reach 1)

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

298,902 149,451 448,354 224,177 672,532 336,266 168,133 504,400 252,200 126,100 63,050 31,525 94,576 47,288 23,644 11,822 5,911 17,734 8,867 26,602 13,301 39,904 19,952 9,976 4,988 2,494 1,247 3,742 1,871 5,614 2,807 8,422 4,211 12,634 6,317 18,952 9,476 4,738 2,369 7,108 3,554 1,777 5,332 2,666 1,333 4,000 2,000 1,000 500 250 125 376 188 94 47 142 71 214 107 322

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #298,901 Browse Full Index Next Integer #298,903 →