3,474,318

2 × 3 × 579053

3,474,318 factors as 2 × 3 × 579053. Its 8 positive divisors give a proper-divisor sum of 3,474,330, so this integer is abundant. The Collatz stopping time is 190 steps.

Prime Factor Structure

Factorization String 2 × 3 × 579053

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,948,648

Proper Divisor Sum 3,474,330

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3474313 ← → #3474323

Radix Representation

Decimal	3474318
Binary	1101010000001110001110 (22 bits)
Octal	0o15201616
Hexadecimal	0x35038E

Divisor Catalog (8)

1 2 3 6 579,053 1,158,106 1,737,159 3,474,318

Collatz Trajectory (190 steps to reach 1)

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

3,474,318 1,737,159 5,211,478 2,605,739 7,817,218 3,908,609 11,725,828 5,862,914 2,931,457 8,794,372 4,397,186 2,198,593 6,595,780 3,297,890 1,648,945 4,946,836 2,473,418 1,236,709 3,710,128 1,855,064 927,532 463,766 231,883 695,650 347,825 1,043,476 521,738 260,869 782,608 391,304 195,652 97,826 48,913 146,740 73,370 36,685 110,056 55,028 27,514 13,757 41,272 20,636 10,318 5,159 15,478 7,739 23,218 11,609 34,828 17,414 8,707 26,122 13,061 39,184 19,592 9,796 4,898 2,449 7,348 3,674

← Previous Integer #3,474,317 Browse Full Index Next Integer #3,474,319 →