3,919,482

2 × 3³ × 7 × 10369

3,919,482 factors as 2 × 3^3 × 7 × 10369. Its 32 positive divisors give a proper-divisor sum of 6,035,718, so this integer is abundant. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 7 × 10369

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,955,200

Proper Divisor Sum 6,035,718

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3919481 ← → #3919501

Radix Representation

Decimal	3919482
Binary	1110111100111001111010 (22 bits)
Octal	0o16747172
Hexadecimal	0x3BCE7A

Divisor Catalog (32)

Collatz Trajectory (141 steps to reach 1)

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

3,919,482 1,959,741 5,879,224 2,939,612 1,469,806 734,903 2,204,710 1,102,355 3,307,066 1,653,533 4,960,600 2,480,300 1,240,150 620,075 1,860,226 930,113 2,790,340 1,395,170 697,585 2,092,756 1,046,378 523,189 1,569,568 784,784 392,392 196,196 98,098 49,049 147,148 73,574 36,787 110,362 55,181 165,544 82,772 41,386 20,693 62,080 31,040 15,520 7,760 3,880 1,940 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155 466 233 700

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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