5,176,890

2 × 3² × 5 × 97 × 593

5,176,890 factors as 2 × 3^2 × 5 × 97 × 593. Its 48 positive divisors give a proper-divisor sum of 8,444,718, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 97 × 593

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 13,621,608

Proper Divisor Sum 8,444,718

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5176879 ← → #5176903

Radix Representation

Decimal	5176890
Binary	10011101111111000111010 (23 bits)
Octal	0o23577072
Hexadecimal	0x4EFE3A

Divisor Catalog (48)

1 2 3 5 6 9 10 15 18 30 45 90 97 194 291 485 582 593 873 970 1,186 1,455 1,746 1,779 2,910 2,965 3,558 4,365 5,337 5,930 8,730 8,895 10,674 17,790 26,685 53,370 57,521 115,042 172,563 287,605 345,126 517,689 575,210 862,815 1,035,378 1,725,630 2,588,445 5,176,890

Collatz Trajectory (100 steps to reach 1)

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

5,176,890 2,588,445 7,765,336 3,882,668 1,941,334 970,667 2,912,002 1,456,001 4,368,004 2,184,002 1,092,001 3,276,004 1,638,002 819,001 2,457,004 1,228,502 614,251 1,842,754 921,377 2,764,132 1,382,066 691,033 2,073,100 1,036,550 518,275 1,554,826 777,413 2,332,240 1,166,120 583,060 291,530 145,765 437,296 218,648 109,324 54,662 27,331 81,994 40,997 122,992 61,496 30,748 15,374 7,687 23,062 11,531 34,594 17,297 51,892 25,946 12,973 38,920 19,460 9,730 4,865 14,596 7,298 3,649 10,948 5,474

← Previous Integer #5,176,889 Browse Full Index Next Integer #5,176,891 →