3,868,068

2² × 3 × 322339

3,868,068 factors as 2^2 × 3 × 322339. Its 12 positive divisors give a proper-divisor sum of 5,157,452, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 322339

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,025,520

Proper Divisor Sum 5,157,452

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3868057 ← → #3868079

Radix Representation

Decimal	3868068
Binary	1110110000010110100100 (22 bits)
Octal	0o16602644
Hexadecimal	0x3B05A4

Divisor Catalog (12)

1 2 3 4 6 12 322,339 644,678 967,017 1,289,356 1,934,034 3,868,068

Collatz Trajectory (97 steps to reach 1)

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

3,868,068 1,934,034 967,017 2,901,052 1,450,526 725,263 2,175,790 1,087,895 3,263,686 1,631,843 4,895,530 2,447,765 7,343,296 3,671,648 1,835,824 917,912 458,956 229,478 114,739 344,218 172,109 516,328 258,164 129,082 64,541 193,624 96,812 48,406 24,203 72,610 36,305 108,916 54,458 27,229 81,688 40,844 20,422 10,211 30,634 15,317 45,952 22,976 11,488 5,744 2,872 1,436 718 359 1,078 539 1,618 809 2,428 1,214 607 1,822 911 2,734 1,367 4,102

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,868,067 Browse Full Index Next Integer #3,868,069 →