5,739,498

2 × 3⁴ × 71 × 499

5,739,498 factors as 2 × 3^4 × 71 × 499. Its 40 positive divisors give a proper-divisor sum of 7,328,502, so this integer is abundant. The Collatz stopping time is 183 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 71 × 499

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 13,068,000

Proper Divisor Sum 7,328,502

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #5739491 ← → #5739541

Radix Representation

Decimal	5739498
Binary	10101111001001111101010 (23 bits)
Octal	0o25711752
Hexadecimal	0x5793EA

Divisor Catalog (40)

1 2 3 6 9 18 27 54 71 81 142 162 213 426 499 639 998 1,278 1,497 1,917 2,994 3,834 4,491 5,751 8,982 11,502 13,473 26,946 35,429 40,419 70,858 80,838 106,287 212,574 318,861 637,722 956,583 1,913,166 2,869,749 5,739,498

Collatz Trajectory (183 steps to reach 1)

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

5,739,498 2,869,749 8,609,248 4,304,624 2,152,312 1,076,156 538,078 269,039 807,118 403,559 1,210,678 605,339 1,816,018 908,009 2,724,028 1,362,014 681,007 2,043,022 1,021,511 3,064,534 1,532,267 4,596,802 2,298,401 6,895,204 3,447,602 1,723,801 5,171,404 2,585,702 1,292,851 3,878,554 1,939,277 5,817,832 2,908,916 1,454,458 727,229 2,181,688 1,090,844 545,422 272,711 818,134 409,067 1,227,202 613,601 1,840,804 920,402 460,201 1,380,604 690,302 345,151 1,035,454 517,727 1,553,182 776,591 2,329,774 1,164,887 3,494,662 1,747,331 5,241,994 2,620,997 7,862,992

← Previous Integer #5,739,497 Browse Full Index Next Integer #5,739,499 →