101,000

2³ × 5³ × 101

101,000 factors as 2^3 × 5^3 × 101. Its 32 positive divisors give a proper-divisor sum of 137,680, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2^3 × 5^3 × 101

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 238,680

Proper Divisor Sum 137,680

Digit Sum / Digital Root 2 (Root: 2)

Adjacent Primes #100999 ← → #101009

Radix Representation

Decimal	101000
Binary	11000101010001000 (17 bits)
Octal	0o305210
Hexadecimal	0x18A88

Divisor Catalog (32)

1 2 4 5 8 10 20 25 40 50 100 101 125 200 202 250 404 500 505 808 1,000 1,010 2,020 2,525 4,040 5,050 10,100 12,625 20,200 25,250 50,500 101,000

Collatz Trajectory (97 steps to reach 1)

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

101,000 50,500 25,250 12,625 37,876 18,938 9,469 28,408 14,204 7,102 3,551 10,654 5,327 15,982 7,991 23,974 11,987 35,962 17,981 53,944 26,972 13,486 6,743 20,230 10,115 30,346 15,173 45,520 22,760 11,380 5,690 2,845 8,536 4,268 2,134 1,067 3,202 1,601 4,804 2,402 1,201 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287 862 431 1,294 647

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #100,999 Browse Full Index Next Integer #101,001 →