3,509,907

3 × 701 × 1669

3,509,907 factors as 3 × 701 × 1669. Its 8 positive divisors give a proper-divisor sum of 1,179,453, so this integer is deficient. The Collatz stopping time is 133 steps.

Prime Factor Structure

Factorization String 3 × 701 × 1669

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,689,360

Proper Divisor Sum 1,179,453

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3509903 ← → #3509911

Radix Representation

Decimal	3509907
Binary	1101011000111010010011 (22 bits)
Octal	0o15307223
Hexadecimal	0x358E93

Divisor Catalog (8)

1 3 701 1,669 2,103 5,007 1,169,969 3,509,907

Collatz Trajectory (133 steps to reach 1)

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

3,509,907 10,529,722 5,264,861 15,794,584 7,897,292 3,948,646 1,974,323 5,922,970 2,961,485 8,884,456 4,442,228 2,221,114 1,110,557 3,331,672 1,665,836 832,918 416,459 1,249,378 624,689 1,874,068 937,034 468,517 1,405,552 702,776 351,388 175,694 87,847 263,542 131,771 395,314 197,657 592,972 296,486 148,243 444,730 222,365 667,096 333,548 166,774 83,387 250,162 125,081 375,244 187,622 93,811 281,434 140,717 422,152 211,076 105,538 52,769 158,308 79,154 39,577 118,732 59,366 29,683 89,050 44,525 133,576

← Previous Integer #3,509,906 Browse Full Index Next Integer #3,509,908 →