466,707

3 × 155569

466,707 factors as 3 × 155569. Its 4 positive divisors give a proper-divisor sum of 155,573, so this integer is deficient. The Collatz stopping time is 156 steps.

Prime Factor Structure

Factorization String 3 × 155569

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 622,280

Proper Divisor Sum 155,573

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #466673 ← → #466717

Radix Representation

Decimal	466707
Binary	1110001111100010011 (19 bits)
Octal	0o1617423
Hexadecimal	0x71F13

Divisor Catalog (4)

1 3 155,569 466,707

Collatz Trajectory (156 steps to reach 1)

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

466,707 1,400,122 700,061 2,100,184 1,050,092 525,046 262,523 787,570 393,785 1,181,356 590,678 295,339 886,018 443,009 1,329,028 664,514 332,257 996,772 498,386 249,193 747,580 373,790 186,895 560,686 280,343 841,030 420,515 1,261,546 630,773 1,892,320 946,160 473,080 236,540 118,270 59,135 177,406 88,703 266,110 133,055 399,166 199,583 598,750 299,375 898,126 449,063 1,347,190 673,595 2,020,786 1,010,393 3,031,180 1,515,590 757,795 2,273,386 1,136,693 3,410,080 1,705,040 852,520 426,260 213,130 106,565

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #466,706 Browse Full Index Next Integer #466,708 →