699,666

2 × 3 × 11 × 10601

699,666 factors as 2 × 3 × 11 × 10601. Its 16 positive divisors give a proper-divisor sum of 827,022, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 10601

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,526,688

Proper Divisor Sum 827,022

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #699649 ← → #699697

Radix Representation

Decimal	699666
Binary	10101010110100010010 (20 bits)
Octal	0o2526422
Hexadecimal	0xAAD12

Divisor Catalog (16)

1 2 3 6 11 22 33 66 10,601 21,202 31,803 63,606 116,611 233,222 349,833 699,666

Collatz Trajectory (154 steps to reach 1)

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

699,666 349,833 1,049,500 524,750 262,375 787,126 393,563 1,180,690 590,345 1,771,036 885,518 442,759 1,328,278 664,139 1,992,418 996,209 2,988,628 1,494,314 747,157 2,241,472 1,120,736 560,368 280,184 140,092 70,046 35,023 105,070 52,535 157,606 78,803 236,410 118,205 354,616 177,308 88,654 44,327 132,982 66,491 199,474 99,737 299,212 149,606 74,803 224,410 112,205 336,616 168,308 84,154 42,077 126,232 63,116 31,558 15,779 47,338 23,669 71,008 35,504 17,752 8,876 4,438

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #699,665 Browse Full Index Next Integer #699,667 →