461,406

2 × 3 × 11 × 6991

461,406 factors as 2 × 3 × 11 × 6991. Its 16 positive divisors give a proper-divisor sum of 545,442, so this integer is abundant. The Collatz stopping time is 76 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 6991

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,006,848

Proper Divisor Sum 545,442

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #461393 ← → #461407

Radix Representation

Decimal	461406
Binary	1110000101001011110 (19 bits)
Octal	0o1605136
Hexadecimal	0x70A5E

Divisor Catalog (16)

1 2 3 6 11 22 33 66 6,991 13,982 20,973 41,946 76,901 153,802 230,703 461,406

Collatz Trajectory (76 steps to reach 1)

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

461,406 230,703 692,110 346,055 1,038,166 519,083 1,557,250 778,625 2,335,876 1,167,938 583,969 1,751,908 875,954 437,977 1,313,932 656,966 328,483 985,450 492,725 1,478,176 739,088 369,544 184,772 92,386 46,193 138,580 69,290 34,645 103,936 51,968 25,984 12,992 6,496 3,248 1,624 812 406 203 610 305 916 458 229 688 344 172 86 43 130 65 196 98 49 148 74 37 112 56 28 14

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #461,405 Browse Full Index Next Integer #461,407 →