504,228

2² × 3 × 42019

504,228 factors as 2^2 × 3 × 42019. Its 12 positive divisors give a proper-divisor sum of 672,332, so this integer is abundant. The Collatz stopping time is 226 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 42019

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,176,560

Proper Divisor Sum 672,332

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #504221 ← → #504247

Radix Representation

Decimal	504228
Binary	1111011000110100100 (19 bits)
Octal	0o1730644
Hexadecimal	0x7B1A4

Divisor Catalog (12)

1 2 3 4 6 12 42,019 84,038 126,057 168,076 252,114 504,228

Collatz Trajectory (226 steps to reach 1)

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

504,228 252,114 126,057 378,172 189,086 94,543 283,630 141,815 425,446 212,723 638,170 319,085 957,256 478,628 239,314 119,657 358,972 179,486 89,743 269,230 134,615 403,846 201,923 605,770 302,885 908,656 454,328 227,164 113,582 56,791 170,374 85,187 255,562 127,781 383,344 191,672 95,836 47,918 23,959 71,878 35,939 107,818 53,909 161,728 80,864 40,432 20,216 10,108 5,054 2,527 7,582 3,791 11,374 5,687 17,062 8,531 25,594 12,797 38,392 19,196

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #504,227 Browse Full Index Next Integer #504,229 →