6,571,014

2 × 3 × 1095169

6,571,014 factors as 2 × 3 × 1095169. Its 8 positive divisors give a proper-divisor sum of 6,571,026, so this integer is abundant. The Collatz stopping time is 178 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1095169

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,142,040

Proper Divisor Sum 6,571,026

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #6571013 ← → #6571021

Radix Representation

Decimal	6571014
Binary	11001000100010000000110 (23 bits)
Octal	0o31042006
Hexadecimal	0x644406

Divisor Catalog (8)

1 2 3 6 1,095,169 2,190,338 3,285,507 6,571,014

Collatz Trajectory (178 steps to reach 1)

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

6,571,014 3,285,507 9,856,522 4,928,261 14,784,784 7,392,392 3,696,196 1,848,098 924,049 2,772,148 1,386,074 693,037 2,079,112 1,039,556 519,778 259,889 779,668 389,834 194,917 584,752 292,376 146,188 73,094 36,547 109,642 54,821 164,464 82,232 41,116 20,558 10,279 30,838 15,419 46,258 23,129 69,388 34,694 17,347 52,042 26,021 78,064 39,032 19,516 9,758 4,879 14,638 7,319 21,958 10,979 32,938 16,469 49,408 24,704 12,352 6,176 3,088 1,544 772 386 193

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,571,013 Browse Full Index Next Integer #6,571,015 →