3,044,936

2³ × 257 × 1481

3,044,936 factors as 2^3 × 257 × 1481. Its 16 positive divisors give a proper-divisor sum of 2,690,404, so this integer is deficient. The Collatz stopping time is 63 steps.

Prime Factor Structure

Factorization String 2^3 × 257 × 1481

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,735,340

Proper Divisor Sum 2,690,404

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #3044929 ← → #3044983

Radix Representation

Decimal	3044936
Binary	1011100111011001001000 (22 bits)
Octal	0o13473110
Hexadecimal	0x2E7648

Divisor Catalog (16)

1 2 4 8 257 514 1,028 1,481 2,056 2,962 5,924 11,848 380,617 761,234 1,522,468 3,044,936

Collatz Trajectory (63 steps to reach 1)

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

3,044,936 1,522,468 761,234 380,617 1,141,852 570,926 285,463 856,390 428,195 1,284,586 642,293 1,926,880 963,440 481,720 240,860 120,430 60,215 180,646 90,323 270,970 135,485 406,456 203,228 101,614 50,807 152,422 76,211 228,634 114,317 342,952 171,476 85,738 42,869 128,608 64,304 32,152 16,076 8,038 4,019 12,058 6,029 18,088 9,044 4,522 2,261 6,784 3,392 1,696 848 424 212 106 53 160 80 40 20 10 5 16

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,044,935 Browse Full Index Next Integer #3,044,937 →