8,000,265

3 × 5 × 7 × 13 × 5861

8,000,265 factors as 3 × 5 × 7 × 13 × 5861. Its 32 positive divisors give a proper-divisor sum of 7,756,791, so this integer is deficient. The Collatz stopping time is 261 steps.

Prime Factor Structure

Factorization String 3 × 5 × 7 × 13 × 5861

Distinct Prime Factors 5

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 15,757,056

Proper Divisor Sum 7,756,791

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #8000261 ← → #8000309

Radix Representation

Decimal	8000265
Binary	11110100001001100001001 (23 bits)
Octal	0o36411411
Hexadecimal	0x7A1309

Divisor Catalog (32)

1 3 5 7 13 15 21 35 39 65 91 105 195 273 455 1,365 5,861 17,583 29,305 41,027 76,193 87,915 123,081 205,135 228,579 380,965 533,351 615,405 1,142,895 1,600,053 2,666,755 8,000,265

Collatz Trajectory (261 steps to reach 1)

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

8,000,265 24,000,796 12,000,398 6,000,199 18,000,598 9,000,299 27,000,898 13,500,449 40,501,348 20,250,674 10,125,337 30,376,012 15,188,006 7,594,003 22,782,010 11,391,005 34,173,016 17,086,508 8,543,254 4,271,627 12,814,882 6,407,441 19,222,324 9,611,162 4,805,581 14,416,744 7,208,372 3,604,186 1,802,093 5,406,280 2,703,140 1,351,570 675,785 2,027,356 1,013,678 506,839 1,520,518 760,259 2,280,778 1,140,389 3,421,168 1,710,584 855,292 427,646 213,823 641,470 320,735 962,206 481,103 1,443,310 721,655 2,164,966 1,082,483 3,247,450 1,623,725 4,871,176 2,435,588 1,217,794 608,897 1,826,692

← Previous Integer #8,000,264 Browse Full Index Next Integer #8,000,266 →