5,367,572

2² × 7 × 191699

5,367,572 factors as 2^2 × 7 × 191699. Its 12 positive divisors give a proper-divisor sum of 5,367,628, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 191699

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,735,200

Proper Divisor Sum 5,367,628

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #5367569 ← → #5367577

Radix Representation

Decimal	5367572
Binary	10100011110011100010100 (23 bits)
Octal	0o24363424
Hexadecimal	0x51E714

Divisor Catalog (12)

1 2 4 7 14 28 191,699 383,398 766,796 1,341,893 2,683,786 5,367,572

Collatz Trajectory (95 steps to reach 1)

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

5,367,572 2,683,786 1,341,893 4,025,680 2,012,840 1,006,420 503,210 251,605 754,816 377,408 188,704 94,352 47,176 23,588 11,794 5,897 17,692 8,846 4,423 13,270 6,635 19,906 9,953 29,860 14,930 7,465 22,396 11,198 5,599 16,798 8,399 25,198 12,599 37,798 18,899 56,698 28,349 85,048 42,524 21,262 10,631 31,894 15,947 47,842 23,921 71,764 35,882 17,941 53,824 26,912 13,456 6,728 3,364 1,682 841 2,524 1,262 631 1,894 947

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,367,571 Browse Full Index Next Integer #5,367,573 →