2,735,322

2 × 3 × 643 × 709

2,735,322 factors as 2 × 3 × 643 × 709. Its 16 positive divisors give a proper-divisor sum of 2,751,558, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2 × 3 × 643 × 709

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,486,880

Proper Divisor Sum 2,751,558

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2735287 ← → #2735323

Radix Representation

Decimal	2735322
Binary	1010011011110011011010 (22 bits)
Octal	0o12336332
Hexadecimal	0x29BCDA

Divisor Catalog (16)

1 2 3 6 643 709 1,286 1,418 1,929 2,127 3,858 4,254 455,887 911,774 1,367,661 2,735,322

Collatz Trajectory (81 steps to reach 1)

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

2,735,322 1,367,661 4,102,984 2,051,492 1,025,746 512,873 1,538,620 769,310 384,655 1,153,966 576,983 1,730,950 865,475 2,596,426 1,298,213 3,894,640 1,947,320 973,660 486,830 243,415 730,246 365,123 1,095,370 547,685 1,643,056 821,528 410,764 205,382 102,691 308,074 154,037 462,112 231,056 115,528 57,764 28,882 14,441 43,324 21,662 10,831 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

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,735,321 Browse Full Index Next Integer #2,735,323 →