3,159,482

2 × 101 × 15641

3,159,482 factors as 2 × 101 × 15641. Its 8 positive divisors give a proper-divisor sum of 1,626,970, so this integer is deficient. The Collatz stopping time is 270 steps.

Prime Factor Structure

Factorization String 2 × 101 × 15641

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,786,452

Proper Divisor Sum 1,626,970

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #3159469 ← → #3159517

Radix Representation

Decimal	3159482
Binary	1100000011010110111010 (22 bits)
Octal	0o14032672
Hexadecimal	0x3035BA

Divisor Catalog (8)

1 2 101 202 15,641 31,282 1,579,741 3,159,482

Collatz Trajectory (270 steps to reach 1)

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

3,159,482 1,579,741 4,739,224 2,369,612 1,184,806 592,403 1,777,210 888,605 2,665,816 1,332,908 666,454 333,227 999,682 499,841 1,499,524 749,762 374,881 1,124,644 562,322 281,161 843,484 421,742 210,871 632,614 316,307 948,922 474,461 1,423,384 711,692 355,846 177,923 533,770 266,885 800,656 400,328 200,164 100,082 50,041 150,124 75,062 37,531 112,594 56,297 168,892 84,446 42,223 126,670 63,335 190,006 95,003 285,010 142,505 427,516 213,758 106,879 320,638 160,319 480,958 240,479 721,438

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,159,481 Browse Full Index Next Integer #3,159,483 →