7,366,638

2 × 3 × 29 × 42337

7,366,638 factors as 2 × 3 × 29 × 42337. Its 16 positive divisors give a proper-divisor sum of 7,875,042, so this integer is abundant. The Collatz stopping time is 67 steps.

Prime Factor Structure

Factorization String 2 × 3 × 29 × 42337

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 15,241,680

Proper Divisor Sum 7,875,042

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #7366633 ← → #7366651

Radix Representation

Decimal	7366638
Binary	11100000110011111101110 (23 bits)
Octal	0o34063756
Hexadecimal	0x7067EE

Divisor Catalog (16)

1 2 3 6 29 58 87 174 42,337 84,674 127,011 254,022 1,227,773 2,455,546 3,683,319 7,366,638

Collatz Trajectory (67 steps to reach 1)

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

7,366,638 3,683,319 11,049,958 5,524,979 16,574,938 8,287,469 24,862,408 12,431,204 6,215,602 3,107,801 9,323,404 4,661,702 2,330,851 6,992,554 3,496,277 10,488,832 5,244,416 2,622,208 1,311,104 655,552 327,776 163,888 81,944 40,972 20,486 10,243 30,730 15,365 46,096 23,048 11,524 5,762 2,881 8,644 4,322 2,161 6,484 3,242 1,621 4,864 2,432 1,216 608 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #7,366,637 Browse Full Index Next Integer #7,366,639 →