896,298

2 × 3 × 13 × 11491

896,298 factors as 2 × 3 × 13 × 11491. Its 16 positive divisors give a proper-divisor sum of 1,034,358, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 11491

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,930,656

Proper Divisor Sum 1,034,358

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #896297 ← → #896299

Radix Representation

Decimal	896298
Binary	11011010110100101010 (20 bits)
Octal	0o3326452
Hexadecimal	0xDAD2A

Divisor Catalog (16)

1 2 3 6 13 26 39 78 11,491 22,982 34,473 68,946 149,383 298,766 448,149 896,298

Collatz Trajectory (139 steps to reach 1)

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

896,298 448,149 1,344,448 672,224 336,112 168,056 84,028 42,014 21,007 63,022 31,511 94,534 47,267 141,802 70,901 212,704 106,352 53,176 26,588 13,294 6,647 19,942 9,971 29,914 14,957 44,872 22,436 11,218 5,609 16,828 8,414 4,207 12,622 6,311 18,934 9,467 28,402 14,201 42,604 21,302 10,651 31,954 15,977 47,932 23,966 11,983 35,950 17,975 53,926 26,963 80,890 40,445 121,336 60,668 30,334 15,167 45,502 22,751 68,254 34,127

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #896,297 Browse Full Index Next Integer #896,299 →