7,467,978

2 × 3 × 7 × 269 × 661

7,467,978 factors as 2 × 3 × 7 × 269 × 661. Its 32 positive divisors give a proper-divisor sum of 9,691,062, so this integer is abundant. The Collatz stopping time is 248 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 269 × 661

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 17,159,040

Proper Divisor Sum 9,691,062

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #7467959 ← → #7467979

Radix Representation

Decimal	7467978
Binary	11100011111001111001010 (23 bits)
Octal	0o34371712
Hexadecimal	0x71F3CA

Divisor Catalog (32)

1 2 3 6 7 14 21 42 269 538 661 807 1,322 1,614 1,883 1,983 3,766 3,966 4,627 5,649 9,254 11,298 13,881 27,762 177,809 355,618 533,427 1,066,854 1,244,663 2,489,326 3,733,989 7,467,978

Collatz Trajectory (248 steps to reach 1)

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

7,467,978 3,733,989 11,201,968 5,600,984 2,800,492 1,400,246 700,123 2,100,370 1,050,185 3,150,556 1,575,278 787,639 2,362,918 1,181,459 3,544,378 1,772,189 5,316,568 2,658,284 1,329,142 664,571 1,993,714 996,857 2,990,572 1,495,286 747,643 2,242,930 1,121,465 3,364,396 1,682,198 841,099 2,523,298 1,261,649 3,784,948 1,892,474 946,237 2,838,712 1,419,356 709,678 354,839 1,064,518 532,259 1,596,778 798,389 2,395,168 1,197,584 598,792 299,396 149,698 74,849 224,548 112,274 56,137 168,412 84,206 42,103 126,310 63,155 189,466 94,733 284,200

← Previous Integer #7,467,977 Browse Full Index Next Integer #7,467,979 →