5,892,018

2 × 3 × 11 × 89273

5,892,018 factors as 2 × 3 × 11 × 89273. Its 16 positive divisors give a proper-divisor sum of 6,963,438, so this integer is abundant. The Collatz stopping time is 77 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 89273

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 12,855,456

Proper Divisor Sum 6,963,438

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5892011 ← → #5892023

Radix Representation

Decimal	5892018
Binary	10110011110011110110010 (23 bits)
Octal	0o26363662
Hexadecimal	0x59E7B2

Divisor Catalog (16)

1 2 3 6 11 22 33 66 89,273 178,546 267,819 535,638 982,003 1,964,006 2,946,009 5,892,018

Collatz Trajectory (77 steps to reach 1)

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

5,892,018 2,946,009 8,838,028 4,419,014 2,209,507 6,628,522 3,314,261 9,942,784 4,971,392 2,485,696 1,242,848 621,424 310,712 155,356 77,678 38,839 116,518 58,259 174,778 87,389 262,168 131,084 65,542 32,771 98,314 49,157 147,472 73,736 36,868 18,434 9,217 27,652 13,826 6,913 20,740 10,370 5,185 15,556 7,778 3,889 11,668 5,834 2,917 8,752 4,376 2,188 1,094 547 1,642 821 2,464 1,232 616 308 154 77 232 116 58 29

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,892,017 Browse Full Index Next Integer #5,892,019 →