3,495,756

2² × 3 × 11 × 71 × 373

3,495,756 factors as 2^2 × 3 × 11 × 71 × 373. Its 48 positive divisors give a proper-divisor sum of 5,552,052, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 71 × 373

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 9,047,808

Proper Divisor Sum 5,552,052

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3495749 ← → #3495773

Radix Representation

Decimal	3495756
Binary	1101010101011101001100 (22 bits)
Octal	0o15253514
Hexadecimal	0x35574C

Divisor Catalog (48)

1 2 3 4 6 11 12 22 33 44 66 71 132 142 213 284 373 426 746 781 852 1,119 1,492 1,562 2,238 2,343 3,124 4,103 4,476 4,686 8,206 9,372 12,309 16,412 24,618 26,483 49,236 52,966 79,449 105,932 158,898 291,313 317,796 582,626 873,939 1,165,252 1,747,878 3,495,756

Collatz Trajectory (146 steps to reach 1)

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

3,495,756 1,747,878 873,939 2,621,818 1,310,909 3,932,728 1,966,364 983,182 491,591 1,474,774 737,387 2,212,162 1,106,081 3,318,244 1,659,122 829,561 2,488,684 1,244,342 622,171 1,866,514 933,257 2,799,772 1,399,886 699,943 2,099,830 1,049,915 3,149,746 1,574,873 4,724,620 2,362,310 1,181,155 3,543,466 1,771,733 5,315,200 2,657,600 1,328,800 664,400 332,200 166,100 83,050 41,525 124,576 62,288 31,144 15,572 7,786 3,893 11,680 5,840 2,920 1,460 730 365 1,096 548 274 137 412 206 103

← Previous Integer #3,495,755 Browse Full Index Next Integer #3,495,757 →