3,534,906

2 × 3 × 37 × 15923

3,534,906 factors as 2 × 3 × 37 × 15923. Its 16 positive divisors give a proper-divisor sum of 3,726,438, so this integer is abundant. The Collatz stopping time is 71 steps.

Prime Factor Structure

Factorization String 2 × 3 × 37 × 15923

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,261,344

Proper Divisor Sum 3,726,438

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3534871 ← → #3534907

Radix Representation

Decimal	3534906
Binary	1101011111000000111010 (22 bits)
Octal	0o15370072
Hexadecimal	0x35F03A

Divisor Catalog (16)

1 2 3 6 37 74 111 222 15,923 31,846 47,769 95,538 589,151 1,178,302 1,767,453 3,534,906

Collatz Trajectory (71 steps to reach 1)

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

3,534,906 1,767,453 5,302,360 2,651,180 1,325,590 662,795 1,988,386 994,193 2,982,580 1,491,290 745,645 2,236,936 1,118,468 559,234 279,617 838,852 419,426 209,713 629,140 314,570 157,285 471,856 235,928 117,964 58,982 29,491 88,474 44,237 132,712 66,356 33,178 16,589 49,768 24,884 12,442 6,221 18,664 9,332 4,666 2,333 7,000 3,500 1,750 875 2,626 1,313 3,940 1,970 985 2,956 1,478 739 2,218 1,109 3,328 1,664 832 416 208 104

← Previous Integer #3,534,905 Browse Full Index Next Integer #3,534,907 →