3,493,376

2⁹ × 6823

3,493,376 factors as 2^9 × 6823. Its 20 positive divisors give a proper-divisor sum of 3,487,576, so this integer is deficient. The Collatz stopping time is 128 steps.

Prime Factor Structure

Factorization String 2^9 × 6823

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 6,980,952

Proper Divisor Sum 3,487,576

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #3493367 ← → #3493379

Radix Representation

Decimal	3493376
Binary	1101010100111000000000 (22 bits)
Octal	0o15247000
Hexadecimal	0x354E00

Divisor Catalog (20)

1 2 4 8 16 32 64 128 256 512 6,823 13,646 27,292 54,584 109,168 218,336 436,672 873,344 1,746,688 3,493,376

Collatz Trajectory (128 steps to reach 1)

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

3,493,376 1,746,688 873,344 436,672 218,336 109,168 54,584 27,292 13,646 6,823 20,470 10,235 30,706 15,353 46,060 23,030 11,515 34,546 17,273 51,820 25,910 12,955 38,866 19,433 58,300 29,150 14,575 43,726 21,863 65,590 32,795 98,386 49,193 147,580 73,790 36,895 110,686 55,343 166,030 83,015 249,046 124,523 373,570 186,785 560,356 280,178 140,089 420,268 210,134 105,067 315,202 157,601 472,804 236,402 118,201 354,604 177,302 88,651 265,954 132,977

← Previous Integer #3,493,375 Browse Full Index Next Integer #3,493,377 →