5,094,573

3 × 11 × 263 × 587

5,094,573 factors as 3 × 11 × 263 × 587. Its 16 positive divisors give a proper-divisor sum of 2,356,563, so this integer is deficient. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 3 × 11 × 263 × 587

Distinct Prime Factors 4

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,451,136

Proper Divisor Sum 2,356,563

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5094559 ← → #5094601

Radix Representation

Decimal	5094573
Binary	10011011011110010101101 (23 bits)
Octal	0o23336255
Hexadecimal	0x4DBCAD

Divisor Catalog (16)

1 3 11 33 263 587 789 1,761 2,893 6,457 8,679 19,371 154,381 463,143 1,698,191 5,094,573

Collatz Trajectory (82 steps to reach 1)

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

5,094,573 15,283,720 7,641,860 3,820,930 1,910,465 5,731,396 2,865,698 1,432,849 4,298,548 2,149,274 1,074,637 3,223,912 1,611,956 805,978 402,989 1,208,968 604,484 302,242 151,121 453,364 226,682 113,341 340,024 170,012 85,006 42,503 127,510 63,755 191,266 95,633 286,900 143,450 71,725 215,176 107,588 53,794 26,897 80,692 40,346 20,173 60,520 30,260 15,130 7,565 22,696 11,348 5,674 2,837 8,512 4,256 2,128 1,064 532 266 133 400 200 100 50 25

← Previous Integer #5,094,572 Browse Full Index Next Integer #5,094,574 →