9,207,876

2² × 3 × 767323

9,207,876 factors as 2^2 × 3 × 767323. Its 12 positive divisors give a proper-divisor sum of 12,277,196, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 767323

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 21,485,072

Proper Divisor Sum 12,277,196

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9207871 ← → #9207901

Radix Representation

Decimal	9207876
Binary	100011001000000001000100 (24 bits)
Octal	0o43100104
Hexadecimal	0x8C8044

Divisor Catalog (12)

1 2 3 4 6 12 767,323 1,534,646 2,301,969 3,069,292 4,603,938 9,207,876

Collatz Trajectory (194 steps to reach 1)

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

9,207,876 4,603,938 2,301,969 6,905,908 3,452,954 1,726,477 5,179,432 2,589,716 1,294,858 647,429 1,942,288 971,144 485,572 242,786 121,393 364,180 182,090 91,045 273,136 136,568 68,284 34,142 17,071 51,214 25,607 76,822 38,411 115,234 57,617 172,852 86,426 43,213 129,640 64,820 32,410 16,205 48,616 24,308 12,154 6,077 18,232 9,116 4,558 2,279 6,838 3,419 10,258 5,129 15,388 7,694 3,847 11,542 5,771 17,314 8,657 25,972 12,986 6,493 19,480 9,740

← Previous Integer #9,207,875 Browse Full Index Next Integer #9,207,877 →