8,645,379

3 × 1063 × 2711

8,645,379 factors as 3 × 1063 × 2711. Its 8 positive divisors give a proper-divisor sum of 2,896,893, so this integer is deficient. The Collatz stopping time is 119 steps.

Prime Factor Structure

Factorization String 3 × 1063 × 2711

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 11,542,272

Proper Divisor Sum 2,896,893

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #8645359 ← → #8645381

Radix Representation

Decimal	8645379
Binary	100000111110101100000011 (24 bits)
Octal	0o40765403
Hexadecimal	0x83EB03

Divisor Catalog (8)

1 3 1,063 2,711 3,189 8,133 2,881,793 8,645,379

Collatz Trajectory (119 steps to reach 1)

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

8,645,379 25,936,138 12,968,069 38,904,208 19,452,104 9,726,052 4,863,026 2,431,513 7,294,540 3,647,270 1,823,635 5,470,906 2,735,453 8,206,360 4,103,180 2,051,590 1,025,795 3,077,386 1,538,693 4,616,080 2,308,040 1,154,020 577,010 288,505 865,516 432,758 216,379 649,138 324,569 973,708 486,854 243,427 730,282 365,141 1,095,424 547,712 273,856 136,928 68,464 34,232 17,116 8,558 4,279 12,838 6,419 19,258 9,629 28,888 14,444 7,222 3,611 10,834 5,417 16,252 8,126 4,063 12,190 6,095 18,286 9,143

← Previous Integer #8,645,378 Browse Full Index Next Integer #8,645,380 →