2,014,158

2 × 3 × 335693

2,014,158 factors as 2 × 3 × 335693. Its 8 positive divisors give a proper-divisor sum of 2,014,170, so this integer is abundant. The Collatz stopping time is 184 steps.

Prime Factor Structure

Factorization String 2 × 3 × 335693

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,028,328

Proper Divisor Sum 2,014,170

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2014157 ← → #2014183

Radix Representation

Decimal	2014158
Binary	111101011101111001110 (21 bits)
Octal	0o7535716
Hexadecimal	0x1EBBCE

Divisor Catalog (8)

1 2 3 6 335,693 671,386 1,007,079 2,014,158

Collatz Trajectory (184 steps to reach 1)

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

2,014,158 1,007,079 3,021,238 1,510,619 4,531,858 2,265,929 6,797,788 3,398,894 1,699,447 5,098,342 2,549,171 7,647,514 3,823,757 11,471,272 5,735,636 2,867,818 1,433,909 4,301,728 2,150,864 1,075,432 537,716 268,858 134,429 403,288 201,644 100,822 50,411 151,234 75,617 226,852 113,426 56,713 170,140 85,070 42,535 127,606 63,803 191,410 95,705 287,116 143,558 71,779 215,338 107,669 323,008 161,504 80,752 40,376 20,188 10,094 5,047 15,142 7,571 22,714 11,357 34,072 17,036 8,518 4,259 12,778

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,014,157 Browse Full Index Next Integer #2,014,159 →