3,090,746

2 × 613 × 2521

3,090,746 factors as 2 × 613 × 2521. Its 8 positive divisors give a proper-divisor sum of 1,554,778, so this integer is deficient. The Collatz stopping time is 102 steps.

Prime Factor Structure

Factorization String 2 × 613 × 2521

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,645,524

Proper Divisor Sum 1,554,778

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #3090743 ← → #3090757

Radix Representation

Decimal	3090746
Binary	1011110010100100111010 (22 bits)
Octal	0o13624472
Hexadecimal	0x2F293A

Divisor Catalog (8)

1 2 613 1,226 2,521 5,042 1,545,373 3,090,746

Collatz Trajectory (102 steps to reach 1)

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

3,090,746 1,545,373 4,636,120 2,318,060 1,159,030 579,515 1,738,546 869,273 2,607,820 1,303,910 651,955 1,955,866 977,933 2,933,800 1,466,900 733,450 366,725 1,100,176 550,088 275,044 137,522 68,761 206,284 103,142 51,571 154,714 77,357 232,072 116,036 58,018 29,009 87,028 43,514 21,757 65,272 32,636 16,318 8,159 24,478 12,239 36,718 18,359 55,078 27,539 82,618 41,309 123,928 61,964 30,982 15,491 46,474 23,237 69,712 34,856 17,428 8,714 4,357 13,072 6,536 3,268

← Previous Integer #3,090,745 Browse Full Index Next Integer #3,090,747 →