697,146

2 × 3 × 116191

697,146 factors as 2 × 3 × 116191. Its 8 positive divisors give a proper-divisor sum of 697,158, so this integer is abundant. The Collatz stopping time is 198 steps.

Prime Factor Structure

Factorization String 2 × 3 × 116191

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,394,304

Proper Divisor Sum 697,158

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #697141 ← → #697157

Radix Representation

Decimal	697146
Binary	10101010001100111010 (20 bits)
Octal	0o2521472
Hexadecimal	0xAA33A

Divisor Catalog (8)

1 2 3 6 116,191 232,382 348,573 697,146

Collatz Trajectory (198 steps to reach 1)

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

697,146 348,573 1,045,720 522,860 261,430 130,715 392,146 196,073 588,220 294,110 147,055 441,166 220,583 661,750 330,875 992,626 496,313 1,488,940 744,470 372,235 1,116,706 558,353 1,675,060 837,530 418,765 1,256,296 628,148 314,074 157,037 471,112 235,556 117,778 58,889 176,668 88,334 44,167 132,502 66,251 198,754 99,377 298,132 149,066 74,533 223,600 111,800 55,900 27,950 13,975 41,926 20,963 62,890 31,445 94,336 47,168 23,584 11,792 5,896 2,948 1,474 737

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #697,145 Browse Full Index Next Integer #697,147 →