690,186

2 × 3 × 7 × 16433

690,186 factors as 2 × 3 × 7 × 16433. Its 16 positive divisors give a proper-divisor sum of 887,478, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 16433

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,577,664

Proper Divisor Sum 887,478

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #690163 ← → #690187

Radix Representation

Decimal	690186
Binary	10101000100000001010 (20 bits)
Octal	0o2504012
Hexadecimal	0xA880A

Divisor Catalog (16)

1 2 3 6 7 14 21 42 16,433 32,866 49,299 98,598 115,031 230,062 345,093 690,186

Collatz Trajectory (136 steps to reach 1)

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

690,186 345,093 1,035,280 517,640 258,820 129,410 64,705 194,116 97,058 48,529 145,588 72,794 36,397 109,192 54,596 27,298 13,649 40,948 20,474 10,237 30,712 15,356 7,678 3,839 11,518 5,759 17,278 8,639 25,918 12,959 38,878 19,439 58,318 29,159 87,478 43,739 131,218 65,609 196,828 98,414 49,207 147,622 73,811 221,434 110,717 332,152 166,076 83,038 41,519 124,558 62,279 186,838 93,419 280,258 140,129 420,388 210,194 105,097 315,292 157,646

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #690,185 Browse Full Index Next Integer #690,187 →