3,494,596

2² × 7 × 137 × 911

3,494,596 factors as 2^2 × 7 × 137 × 911. Its 24 positive divisors give a proper-divisor sum of 3,553,340, so this integer is abundant. The Collatz stopping time is 128 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 137 × 911

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 7,047,936

Proper Divisor Sum 3,553,340

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #3494573 ← → #3494609

Radix Representation

Decimal	3494596
Binary	1101010101001011000100 (22 bits)
Octal	0o15251304
Hexadecimal	0x3552C4

Divisor Catalog (24)

Collatz Trajectory (128 steps to reach 1)

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

3,494,596 1,747,298 873,649 2,620,948 1,310,474 655,237 1,965,712 982,856 491,428 245,714 122,857 368,572 184,286 92,143 276,430 138,215 414,646 207,323 621,970 310,985 932,956 466,478 233,239 699,718 349,859 1,049,578 524,789 1,574,368 787,184 393,592 196,796 98,398 49,199 147,598 73,799 221,398 110,699 332,098 166,049 498,148 249,074 124,537 373,612 186,806 93,403 280,210 140,105 420,316 210,158 105,079 315,238 157,619 472,858 236,429 709,288 354,644 177,322 88,661 265,984 132,992

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,494,595 Browse Full Index Next Integer #3,494,597 →