6,935,658

2 × 3 × 1155943

6,935,658 factors as 2 × 3 × 1155943. Its 8 positive divisors give a proper-divisor sum of 6,935,670, so this integer is abundant. The Collatz stopping time is 191 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1155943

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,871,328

Proper Divisor Sum 6,935,670

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #6935629 ← → #6935671

Radix Representation

Decimal	6935658
Binary	11010011101010001101010 (23 bits)
Octal	0o32352152
Hexadecimal	0x69D46A

Divisor Catalog (8)

1 2 3 6 1,155,943 2,311,886 3,467,829 6,935,658

Collatz Trajectory (191 steps to reach 1)

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

6,935,658 3,467,829 10,403,488 5,201,744 2,600,872 1,300,436 650,218 325,109 975,328 487,664 243,832 121,916 60,958 30,479 91,438 45,719 137,158 68,579 205,738 102,869 308,608 154,304 77,152 38,576 19,288 9,644 4,822 2,411 7,234 3,617 10,852 5,426 2,713 8,140 4,070 2,035 6,106 3,053 9,160 4,580 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900 2,450 1,225

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,935,657 Browse Full Index Next Integer #6,935,659 →