90,018

2 × 3³ × 1667

90,018 factors as 2 × 3^3 × 1667. Its 16 positive divisors give a proper-divisor sum of 110,142, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 1667

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 200,160

Proper Divisor Sum 110,142

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #90017 ← → #90019

Radix Representation

Decimal	90018
Binary	10101111110100010 (17 bits)
Octal	0o257642
Hexadecimal	0x15FA2

Divisor Catalog (16)

1 2 3 6 9 18 27 54 1,667 3,334 5,001 10,002 15,003 30,006 45,009 90,018

Collatz Trajectory (164 steps to reach 1)

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

90,018 45,009 135,028 67,514 33,757 101,272 50,636 25,318 12,659 37,978 18,989 56,968 28,484 14,242 7,121 21,364 10,682 5,341 16,024 8,012 4,006 2,003 6,010 3,005 9,016 4,508 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

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #90,017 Browse Full Index Next Integer #90,019 →