3,077,274

2 × 3 × 401 × 1279

3,077,274 factors as 2 × 3 × 401 × 1279. Its 16 positive divisors give a proper-divisor sum of 3,097,446, so this integer is abundant. The Collatz stopping time is 76 steps.

Prime Factor Structure

Factorization String 2 × 3 × 401 × 1279

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,174,720

Proper Divisor Sum 3,097,446

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3077273 ← → #3077279

Radix Representation

Decimal	3077274
Binary	1011101111010010011010 (22 bits)
Octal	0o13572232
Hexadecimal	0x2EF49A

Divisor Catalog (16)

1 2 3 6 401 802 1,203 1,279 2,406 2,558 3,837 7,674 512,879 1,025,758 1,538,637 3,077,274

Collatz Trajectory (76 steps to reach 1)

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

3,077,274 1,538,637 4,615,912 2,307,956 1,153,978 576,989 1,730,968 865,484 432,742 216,371 649,114 324,557 973,672 486,836 243,418 121,709 365,128 182,564 91,282 45,641 136,924 68,462 34,231 102,694 51,347 154,042 77,021 231,064 115,532 57,766 28,883 86,650 43,325 129,976 64,988 32,494 16,247 48,742 24,371 73,114 36,557 109,672 54,836 27,418 13,709 41,128 20,564 10,282 5,141 15,424 7,712 3,856 1,928 964 482 241 724 362 181 544

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,077,273 Browse Full Index Next Integer #3,077,275 →