7,945,296

2⁴ × 3 × 165527

7,945,296 factors as 2^4 × 3 × 165527. Its 20 positive divisors give a proper-divisor sum of 12,580,176, so this integer is abundant. The Collatz stopping time is 155 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 165527

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 20,525,472

Proper Divisor Sum 12,580,176

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #7945291 ← → #7945309

Radix Representation

Decimal	7945296
Binary	11110010011110001010000 (23 bits)
Octal	0o36236120
Hexadecimal	0x793C50

Divisor Catalog (20)

1 2 3 4 6 8 12 16 24 48 165,527 331,054 496,581 662,108 993,162 1,324,216 1,986,324 2,648,432 3,972,648 7,945,296

Collatz Trajectory (155 steps to reach 1)

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

7,945,296 3,972,648 1,986,324 993,162 496,581 1,489,744 744,872 372,436 186,218 93,109 279,328 139,664 69,832 34,916 17,458 8,729 26,188 13,094 6,547 19,642 9,821 29,464 14,732 7,366 3,683 11,050 5,525 16,576 8,288 4,144 2,072 1,036 518 259 778 389 1,168 584 292 146 73 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242

← Previous Integer #7,945,295 Browse Full Index Next Integer #7,945,297 →