2,678,689

13 × 37 × 5569

2,678,689 factors as 13 × 37 × 5569. Its 8 positive divisors give a proper-divisor sum of 284,551, so this integer is deficient. The Collatz stopping time is 262 steps.

Prime Factor Structure

Factorization String 13 × 37 × 5569

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,963,240

Proper Divisor Sum 284,551

Digit Sum / Digital Root 46 (Root: 1)

Adjacent Primes #2678681 ← → #2678699

Radix Representation

Decimal	2678689
Binary	1010001101111110100001 (22 bits)
Octal	0o12157641
Hexadecimal	0x28DFA1

Divisor Catalog (8)

1 13 37 481 5,569 72,397 206,053 2,678,689

Collatz Trajectory (262 steps to reach 1)

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

2,678,689 8,036,068 4,018,034 2,009,017 6,027,052 3,013,526 1,506,763 4,520,290 2,260,145 6,780,436 3,390,218 1,695,109 5,085,328 2,542,664 1,271,332 635,666 317,833 953,500 476,750 238,375 715,126 357,563 1,072,690 536,345 1,609,036 804,518 402,259 1,206,778 603,389 1,810,168 905,084 452,542 226,271 678,814 339,407 1,018,222 509,111 1,527,334 763,667 2,291,002 1,145,501 3,436,504 1,718,252 859,126 429,563 1,288,690 644,345 1,933,036 966,518 483,259 1,449,778 724,889 2,174,668 1,087,334 543,667 1,631,002 815,501 2,446,504 1,223,252 611,626

← Previous Integer #2,678,688 Browse Full Index Next Integer #2,678,690 →