113,890

2 × 5 × 7 × 1627

113,890 factors as 2 × 5 × 7 × 1627. Its 16 positive divisors give a proper-divisor sum of 120,542, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 1627

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 234,432

Proper Divisor Sum 120,542

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #113843 ← → #113891

Radix Representation

Decimal	113890
Binary	11011110011100010 (17 bits)
Octal	0o336342
Hexadecimal	0x1BCE2

Divisor Catalog (16)

1 2 5 7 10 14 35 70 1,627 3,254 8,135 11,389 16,270 22,778 56,945 113,890

Collatz Trajectory (154 steps to reach 1)

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

113,890 56,945 170,836 85,418 42,709 128,128 64,064 32,032 16,016 8,008 4,004 2,002 1,001 3,004 1,502 751 2,254 1,127 3,382 1,691 5,074 2,537 7,612 3,806 1,903 5,710 2,855 8,566 4,283 12,850 6,425 19,276 9,638 4,819 14,458 7,229 21,688 10,844 5,422 2,711 8,134 4,067 12,202 6,101 18,304 9,152 4,576 2,288 1,144 572 286 143 430 215 646 323 970 485 1,456 728

← Previous Integer #113,889 Browse Full Index Next Integer #113,891 →