2,738,271

3 × 613 × 1489

2,738,271 factors as 3 × 613 × 1489. Its 8 positive divisors give a proper-divisor sum of 921,169, so this integer is deficient. The Collatz stopping time is 156 steps.

Prime Factor Structure

Factorization String 3 × 613 × 1489

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,659,440

Proper Divisor Sum 921,169

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2738269 ← → #2738273

Radix Representation

Decimal	2738271
Binary	1010011100100001011111 (22 bits)
Octal	0o12344137
Hexadecimal	0x29C85F

Divisor Catalog (8)

1 3 613 1,489 1,839 4,467 912,757 2,738,271

Collatz Trajectory (156 steps to reach 1)

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

2,738,271 8,214,814 4,107,407 12,322,222 6,161,111 18,483,334 9,241,667 27,725,002 13,862,501 41,587,504 20,793,752 10,396,876 5,198,438 2,599,219 7,797,658 3,898,829 11,696,488 5,848,244 2,924,122 1,462,061 4,386,184 2,193,092 1,096,546 548,273 1,644,820 822,410 411,205 1,233,616 616,808 308,404 154,202 77,101 231,304 115,652 57,826 28,913 86,740 43,370 21,685 65,056 32,528 16,264 8,132 4,066 2,033 6,100 3,050 1,525 4,576 2,288 1,144 572 286 143 430 215 646 323 970 485

← Previous Integer #2,738,270 Browse Full Index Next Integer #2,738,272 →