1,237,254

2 × 3 × 206209

1,237,254 factors as 2 × 3 × 206209. Its 8 positive divisors give a proper-divisor sum of 1,237,266, so this integer is abundant. The Collatz stopping time is 173 steps.

Prime Factor Structure

Factorization String 2 × 3 × 206209

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,474,520

Proper Divisor Sum 1,237,266

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1237253 ← → #1237273

Radix Representation

Decimal	1237254
Binary	100101110000100000110 (21 bits)
Octal	0o4560406
Hexadecimal	0x12E106

Divisor Catalog (8)

1 2 3 6 206,209 412,418 618,627 1,237,254

Collatz Trajectory (173 steps to reach 1)

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

1,237,254 618,627 1,855,882 927,941 2,783,824 1,391,912 695,956 347,978 173,989 521,968 260,984 130,492 65,246 32,623 97,870 48,935 146,806 73,403 220,210 110,105 330,316 165,158 82,579 247,738 123,869 371,608 185,804 92,902 46,451 139,354 69,677 209,032 104,516 52,258 26,129 78,388 39,194 19,597 58,792 29,396 14,698 7,349 22,048 11,024 5,512 2,756 1,378 689 2,068 1,034 517 1,552 776 388 194 97 292 146 73 220

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,237,253 Browse Full Index Next Integer #1,237,255 →