3,095,876

2² × 7 × 110567

3,095,876 factors as 2^2 × 7 × 110567. Its 12 positive divisors give a proper-divisor sum of 3,095,932, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 110567

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,191,808

Proper Divisor Sum 3,095,932

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #3095867 ← → #3095893

Radix Representation

Decimal	3095876
Binary	1011110011110101000100 (22 bits)
Octal	0o13636504
Hexadecimal	0x2F3D44

Divisor Catalog (12)

1 2 4 7 14 28 110,567 221,134 442,268 773,969 1,547,938 3,095,876

Collatz Trajectory (89 steps to reach 1)

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

3,095,876 1,547,938 773,969 2,321,908 1,160,954 580,477 1,741,432 870,716 435,358 217,679 653,038 326,519 979,558 489,779 1,469,338 734,669 2,204,008 1,102,004 551,002 275,501 826,504 413,252 206,626 103,313 309,940 154,970 77,485 232,456 116,228 58,114 29,057 87,172 43,586 21,793 65,380 32,690 16,345 49,036 24,518 12,259 36,778 18,389 55,168 27,584 13,792 6,896 3,448 1,724 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,095,875 Browse Full Index Next Integer #3,095,877 →