2,014,170

2 × 3 × 5 × 67139

2,014,170 factors as 2 × 3 × 5 × 67139. Its 16 positive divisors give a proper-divisor sum of 2,819,910, so this integer is abundant. The Collatz stopping time is 184 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 67139

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,834,080

Proper Divisor Sum 2,819,910

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #2014157 ← → #2014183

Radix Representation

Decimal	2014170
Binary	111101011101111011010 (21 bits)
Octal	0o7535732
Hexadecimal	0x1EBBDA

Divisor Catalog (16)

1 2 3 5 6 10 15 30 67,139 134,278 201,417 335,695 402,834 671,390 1,007,085 2,014,170

Collatz Trajectory (184 steps to reach 1)

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

2,014,170 1,007,085 3,021,256 1,510,628 755,314 377,657 1,132,972 566,486 283,243 849,730 424,865 1,274,596 637,298 318,649 955,948 477,974 238,987 716,962 358,481 1,075,444 537,722 268,861 806,584 403,292 201,646 100,823 302,470 151,235 453,706 226,853 680,560 340,280 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,169 Browse Full Index Next Integer #2,014,171 →