797,250

2 × 3 × 5³ × 1063

797,250 factors as 2 × 3 × 5^3 × 1063. Its 32 positive divisors give a proper-divisor sum of 1,194,558, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^3 × 1063

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 1,991,808

Proper Divisor Sum 1,194,558

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #797207 ← → #797273

Radix Representation

Decimal	797250
Binary	11000010101001000010 (20 bits)
Octal	0o3025102
Hexadecimal	0xC2A42

Divisor Catalog (32)

Collatz Trajectory (100 steps to reach 1)

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

797,250 398,625 1,195,876 597,938 298,969 896,908 448,454 224,227 672,682 336,341 1,009,024 504,512 252,256 126,128 63,064 31,532 15,766 7,883 23,650 11,825 35,476 17,738 8,869 26,608 13,304 6,652 3,326 1,663 4,990 2,495 7,486 3,743 11,230 5,615 16,846 8,423 25,270 12,635 37,906 18,953 56,860 28,430 14,215 42,646 21,323 63,970 31,985 95,956 47,978 23,989 71,968 35,984 17,992 8,996 4,498 2,249 6,748 3,374 1,687 5,062

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #797,249 Browse Full Index Next Integer #797,251 →