485,708

2² × 31 × 3917

485,708 factors as 2^2 × 31 × 3917. Its 12 positive divisors give a proper-divisor sum of 391,924, so this integer is deficient. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2^2 × 31 × 3917

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 877,632

Proper Divisor Sum 391,924

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #485701 ← → #485717

Radix Representation

Decimal	485708
Binary	1110110100101001100 (19 bits)
Octal	0o1664514
Hexadecimal	0x7694C

Divisor Catalog (12)

1 2 4 31 62 124 3,917 7,834 15,668 121,427 242,854 485,708

Collatz Trajectory (89 steps to reach 1)

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

485,708 242,854 121,427 364,282 182,141 546,424 273,212 136,606 68,303 204,910 102,455 307,366 153,683 461,050 230,525 691,576 345,788 172,894 86,447 259,342 129,671 389,014 194,507 583,522 291,761 875,284 437,642 218,821 656,464 328,232 164,116 82,058 41,029 123,088 61,544 30,772 15,386 7,693 23,080 11,540 5,770 2,885 8,656 4,328 2,164 1,082 541 1,624 812 406 203 610 305 916 458 229 688 344 172 86

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #485,707 Browse Full Index Next Integer #485,709 →