16,601,634

2 × 3² × 7 × 131759

16,601,634 factors as 2 × 3^2 × 7 × 131759. Its 24 positive divisors give a proper-divisor sum of 24,507,486, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 7 × 131759

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 41,109,120

Proper Divisor Sum 24,507,486

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #16601633 ← → #16601693

Radix Representation

Decimal	16601634
Binary	111111010101001000100010 (24 bits)
Octal	0o77251042
Hexadecimal	0xFD5222

Divisor Catalog (24)

Collatz Trajectory (81 steps to reach 1)

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

16,601,634 8,300,817 24,902,452 12,451,226 6,225,613 18,676,840 9,338,420 4,669,210 2,334,605 7,003,816 3,501,908 1,750,954 875,477 2,626,432 1,313,216 656,608 328,304 164,152 82,076 41,038 20,519 61,558 30,779 92,338 46,169 138,508 69,254 34,627 103,882 51,941 155,824 77,912 38,956 19,478 9,739 29,218 14,609 43,828 21,914 10,957 32,872 16,436 8,218 4,109 12,328 6,164 3,082 1,541 4,624 2,312 1,156 578 289 868 434 217 652 326 163 490

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #16,601,633 Browse Full Index Next Integer #16,601,635 →