2,598,958

2 × 1129 × 1151

2,598,958 factors as 2 × 1129 × 1151. Its 8 positive divisors give a proper-divisor sum of 1,306,322, so this integer is deficient. The Collatz stopping time is 156 steps.

Prime Factor Structure

Factorization String 2 × 1129 × 1151

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,905,280

Proper Divisor Sum 1,306,322

Digit Sum / Digital Root 46 (Root: 1)

Adjacent Primes #2598941 ← → #2598971

Radix Representation

Decimal	2598958
Binary	1001111010100000101110 (22 bits)
Octal	0o11724056
Hexadecimal	0x27A82E

Divisor Catalog (8)

1 2 1,129 1,151 2,258 2,302 1,299,479 2,598,958

Collatz Trajectory (156 steps to reach 1)

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

2,598,958 1,299,479 3,898,438 1,949,219 5,847,658 2,923,829 8,771,488 4,385,744 2,192,872 1,096,436 548,218 274,109 822,328 411,164 205,582 102,791 308,374 154,187 462,562 231,281 693,844 346,922 173,461 520,384 260,192 130,096 65,048 32,524 16,262 8,131 24,394 12,197 36,592 18,296 9,148 4,574 2,287 6,862 3,431 10,294 5,147 15,442 7,721 23,164 11,582 5,791 17,374 8,687 26,062 13,031 39,094 19,547 58,642 29,321 87,964 43,982 21,991 65,974 32,987 98,962

← Previous Integer #2,598,957 Browse Full Index Next Integer #2,598,959 →