9,237,252

2² × 3 × 157 × 4903

9,237,252 factors as 2^2 × 3 × 157 × 4903. Its 24 positive divisors give a proper-divisor sum of 12,458,044, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 157 × 4903

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 21,695,296

Proper Divisor Sum 12,458,044

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9237227 ← → #9237253

Radix Representation

Decimal	9237252
Binary	100011001111001100000100 (24 bits)
Octal	0o43171404
Hexadecimal	0x8CF304

Divisor Catalog (24)

1 2 3 4 6 12 157 314 471 628 942 1,884 4,903 9,806 14,709 19,612 29,418 58,836 769,771 1,539,542 2,309,313 3,079,084 4,618,626 9,237,252

Collatz Trajectory (88 steps to reach 1)

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

9,237,252 4,618,626 2,309,313 6,927,940 3,463,970 1,731,985 5,195,956 2,597,978 1,298,989 3,896,968 1,948,484 974,242 487,121 1,461,364 730,682 365,341 1,096,024 548,012 274,006 137,003 411,010 205,505 616,516 308,258 154,129 462,388 231,194 115,597 346,792 173,396 86,698 43,349 130,048 65,024 32,512 16,256 8,128 4,064 2,032 1,016 508 254 127 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640

← Previous Integer #9,237,251 Browse Full Index Next Integer #9,237,253 →