3,499,581

3 × 1166527

3,499,581 factors as 3 × 1166527. Its 4 positive divisors give a proper-divisor sum of 1,166,531, so this integer is deficient. The Collatz stopping time is 190 steps.

Prime Factor Structure

Factorization String 3 × 1166527

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 4,666,112

Proper Divisor Sum 1,166,531

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3499577 ← → #3499583

Radix Representation

Decimal	3499581
Binary	1101010110011000111101 (22 bits)
Octal	0o15263075
Hexadecimal	0x35663D

Divisor Catalog (4)

1 3 1,166,527 3,499,581

Collatz Trajectory (190 steps to reach 1)

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

3,499,581 10,498,744 5,249,372 2,624,686 1,312,343 3,937,030 1,968,515 5,905,546 2,952,773 8,858,320 4,429,160 2,214,580 1,107,290 553,645 1,660,936 830,468 415,234 207,617 622,852 311,426 155,713 467,140 233,570 116,785 350,356 175,178 87,589 262,768 131,384 65,692 32,846 16,423 49,270 24,635 73,906 36,953 110,860 55,430 27,715 83,146 41,573 124,720 62,360 31,180 15,590 7,795 23,386 11,693 35,080 17,540 8,770 4,385 13,156 6,578 3,289 9,868 4,934 2,467 7,402 3,701

← Previous Integer #3,499,580 Browse Full Index Next Integer #3,499,582 →