2,679,157

13² × 83 × 191

2,679,157 factors as 13^2 × 83 × 191. Its 12 positive divisors give a proper-divisor sum of 272,267, so this integer is deficient. The Collatz stopping time is 68 steps.

Prime Factor Structure

Factorization String 13^2 × 83 × 191

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,951,424

Proper Divisor Sum 272,267

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #2679143 ← → #2679163

Radix Representation

Decimal	2679157
Binary	1010001110000101110101 (22 bits)
Octal	0o12160565
Hexadecimal	0x28E175

Divisor Catalog (12)

1 13 83 169 191 1,079 2,483 14,027 15,853 32,279 206,089 2,679,157

Collatz Trajectory (68 steps to reach 1)

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

2,679,157 8,037,472 4,018,736 2,009,368 1,004,684 502,342 251,171 753,514 376,757 1,130,272 565,136 282,568 141,284 70,642 35,321 105,964 52,982 26,491 79,474 39,737 119,212 59,606 29,803 89,410 44,705 134,116 67,058 33,529 100,588 50,294 25,147 75,442 37,721 113,164 56,582 28,291 84,874 42,437 127,312 63,656 31,828 15,914 7,957 23,872 11,936 5,968 2,984 1,492 746 373 1,120 560 280 140 70 35 106 53 160 80

← Previous Integer #2,679,156 Browse Full Index Next Integer #2,679,158 →