3,674,868

2² × 3 × 306239

3,674,868 factors as 2^2 × 3 × 306239. Its 12 positive divisors give a proper-divisor sum of 4,899,852, so this integer is abundant. The Collatz stopping time is 110 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 306239

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 8,574,720

Proper Divisor Sum 4,899,852

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #3674863 ← → #3674897

Radix Representation

Decimal	3674868
Binary	1110000001001011110100 (22 bits)
Octal	0o16011364
Hexadecimal	0x3812F4

Divisor Catalog (12)

1 2 3 4 6 12 306,239 612,478 918,717 1,224,956 1,837,434 3,674,868

Collatz Trajectory (110 steps to reach 1)

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

3,674,868 1,837,434 918,717 2,756,152 1,378,076 689,038 344,519 1,033,558 516,779 1,550,338 775,169 2,325,508 1,162,754 581,377 1,744,132 872,066 436,033 1,308,100 654,050 327,025 981,076 490,538 245,269 735,808 367,904 183,952 91,976 45,988 22,994 11,497 34,492 17,246 8,623 25,870 12,935 38,806 19,403 58,210 29,105 87,316 43,658 21,829 65,488 32,744 16,372 8,186 4,093 12,280 6,140 3,070 1,535 4,606 2,303 6,910 3,455 10,366 5,183 15,550 7,775 23,326

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,674,867 Browse Full Index Next Integer #3,674,869 →