3,155,512

2³ × 43 × 9173

3,155,512 factors as 2^3 × 43 × 9173. Its 16 positive divisors give a proper-divisor sum of 2,899,328, so this integer is deficient. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2^3 × 43 × 9173

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,054,840

Proper Divisor Sum 2,899,328

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #3155473 ← → #3155513

Radix Representation

Decimal	3155512
Binary	1100000010011000111000 (22 bits)
Octal	0o14023070
Hexadecimal	0x302638

Divisor Catalog (16)

1 2 4 8 43 86 172 344 9,173 18,346 36,692 73,384 394,439 788,878 1,577,756 3,155,512

Collatz Trajectory (164 steps to reach 1)

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

3,155,512 1,577,756 788,878 394,439 1,183,318 591,659 1,774,978 887,489 2,662,468 1,331,234 665,617 1,996,852 998,426 499,213 1,497,640 748,820 374,410 187,205 561,616 280,808 140,404 70,202 35,101 105,304 52,652 26,326 13,163 39,490 19,745 59,236 29,618 14,809 44,428 22,214 11,107 33,322 16,661 49,984 24,992 12,496 6,248 3,124 1,562 781 2,344 1,172 586 293 880 440 220 110 55 166 83 250 125 376 188 94

← Previous Integer #3,155,511 Browse Full Index Next Integer #3,155,513 →