475,866

2 × 3² × 26437

475,866 factors as 2 × 3^2 × 26437. Its 12 positive divisors give a proper-divisor sum of 555,216, so this integer is abundant. The Collatz stopping time is 125 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 26437

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,031,082

Proper Divisor Sum 555,216

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #475859 ← → #475877

Radix Representation

Decimal	475866
Binary	1110100001011011010 (19 bits)
Octal	0o1641332
Hexadecimal	0x742DA

Divisor Catalog (12)

1 2 3 6 9 18 26,437 52,874 79,311 158,622 237,933 475,866

Collatz Trajectory (125 steps to reach 1)

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

475,866 237,933 713,800 356,900 178,450 89,225 267,676 133,838 66,919 200,758 100,379 301,138 150,569 451,708 225,854 112,927 338,782 169,391 508,174 254,087 762,262 381,131 1,143,394 571,697 1,715,092 857,546 428,773 1,286,320 643,160 321,580 160,790 80,395 241,186 120,593 361,780 180,890 90,445 271,336 135,668 67,834 33,917 101,752 50,876 25,438 12,719 38,158 19,079 57,238 28,619 85,858 42,929 128,788 64,394 32,197 96,592 48,296 24,148 12,074 6,037 18,112

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #475,865 Browse Full Index Next Integer #475,867 →