8,099,652

2² × 3 × 11 × 43 × 1427

8,099,652 factors as 2^2 × 3 × 11 × 43 × 1427. Its 48 positive divisors give a proper-divisor sum of 13,011,900, so this integer is abundant. The Collatz stopping time is 186 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 43 × 1427

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 21,111,552

Proper Divisor Sum 13,011,900

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8099639 ← → #8099653

Radix Representation

Decimal	8099652
Binary	11110111001011101000100 (23 bits)
Octal	0o36713504
Hexadecimal	0x7B9744

Divisor Catalog (48)

1 2 3 4 6 11 12 22 33 43 44 66 86 129 132 172 258 473 516 946 1,419 1,427 1,892 2,838 2,854 4,281 5,676 5,708 8,562 15,697 17,124 31,394 47,091 61,361 62,788 94,182 122,722 184,083 188,364 245,444 368,166 674,971 736,332 1,349,942 2,024,913 2,699,884 4,049,826 8,099,652

Collatz Trajectory (186 steps to reach 1)

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

8,099,652 4,049,826 2,024,913 6,074,740 3,037,370 1,518,685 4,556,056 2,278,028 1,139,014 569,507 1,708,522 854,261 2,562,784 1,281,392 640,696 320,348 160,174 80,087 240,262 120,131 360,394 180,197 540,592 270,296 135,148 67,574 33,787 101,362 50,681 152,044 76,022 38,011 114,034 57,017 171,052 85,526 42,763 128,290 64,145 192,436 96,218 48,109 144,328 72,164 36,082 18,041 54,124 27,062 13,531 40,594 20,297 60,892 30,446 15,223 45,670 22,835 68,506 34,253 102,760 51,380

← Previous Integer #8,099,651 Browse Full Index Next Integer #8,099,653 →