1,296,492

2² × 3 × 108041

1,296,492 factors as 2^2 × 3 × 108041. Its 12 positive divisors give a proper-divisor sum of 1,728,684, so this integer is abundant. The Collatz stopping time is 186 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 108041

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,025,176

Proper Divisor Sum 1,728,684

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1296481 ← → #1296499

Radix Representation

Decimal	1296492
Binary	100111100100001101100 (21 bits)
Octal	0o4744154
Hexadecimal	0x13C86C

Divisor Catalog (12)

1 2 3 4 6 12 108,041 216,082 324,123 432,164 648,246 1,296,492

Collatz Trajectory (186 steps to reach 1)

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

1,296,492 648,246 324,123 972,370 486,185 1,458,556 729,278 364,639 1,093,918 546,959 1,640,878 820,439 2,461,318 1,230,659 3,691,978 1,845,989 5,537,968 2,768,984 1,384,492 692,246 346,123 1,038,370 519,185 1,557,556 778,778 389,389 1,168,168 584,084 292,042 146,021 438,064 219,032 109,516 54,758 27,379 82,138 41,069 123,208 61,604 30,802 15,401 46,204 23,102 11,551 34,654 17,327 51,982 25,991 77,974 38,987 116,962 58,481 175,444 87,722 43,861 131,584 65,792 32,896 16,448 8,224

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,296,491 Browse Full Index Next Integer #1,296,493 →