6,595,098

2 × 3 × 101 × 10883

6,595,098 factors as 2 × 3 × 101 × 10883. Its 16 positive divisors give a proper-divisor sum of 6,726,918, so this integer is abundant. The Collatz stopping time is 178 steps.

Prime Factor Structure

Factorization String 2 × 3 × 101 × 10883

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 13,322,016

Proper Divisor Sum 6,726,918

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #6595091 ← → #6595103

Radix Representation

Decimal	6595098
Binary	11001001010001000011010 (23 bits)
Octal	0o31121032
Hexadecimal	0x64A21A

Divisor Catalog (16)

1 2 3 6 101 202 303 606 10,883 21,766 32,649 65,298 1,099,183 2,198,366 3,297,549 6,595,098

Collatz Trajectory (178 steps to reach 1)

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

6,595,098 3,297,549 9,892,648 4,946,324 2,473,162 1,236,581 3,709,744 1,854,872 927,436 463,718 231,859 695,578 347,789 1,043,368 521,684 260,842 130,421 391,264 195,632 97,816 48,908 24,454 12,227 36,682 18,341 55,024 27,512 13,756 6,878 3,439 10,318 5,159 15,478 7,739 23,218 11,609 34,828 17,414 8,707 26,122 13,061 39,184 19,592 9,796 4,898 2,449 7,348 3,674 1,837 5,512 2,756 1,378 689 2,068 1,034 517 1,552 776 388 194

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,595,097 Browse Full Index Next Integer #6,595,099 →