5,962,938

2 × 3 × 993823

5,962,938 factors as 2 × 3 × 993823. Its 8 positive divisors give a proper-divisor sum of 5,962,950, so this integer is abundant. The Collatz stopping time is 152 steps.

Prime Factor Structure

Factorization String 2 × 3 × 993823

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 11,925,888

Proper Divisor Sum 5,962,950

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5962919 ← → #5962949

Radix Representation

Decimal	5962938
Binary	10110101111110010111010 (23 bits)
Octal	0o26576272
Hexadecimal	0x5AFCBA

Divisor Catalog (8)

1 2 3 6 993,823 1,987,646 2,981,469 5,962,938

Collatz Trajectory (152 steps to reach 1)

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

5,962,938 2,981,469 8,944,408 4,472,204 2,236,102 1,118,051 3,354,154 1,677,077 5,031,232 2,515,616 1,257,808 628,904 314,452 157,226 78,613 235,840 117,920 58,960 29,480 14,740 7,370 3,685 11,056 5,528 2,764 1,382 691 2,074 1,037 3,112 1,556 778 389 1,168 584 292 146 73 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,962,937 Browse Full Index Next Integer #5,962,939 →