8,209,290

2 × 3 × 5 × 273643

8,209,290 factors as 2 × 3 × 5 × 273643. Its 16 positive divisors give a proper-divisor sum of 11,493,078, so this integer is abundant. The Collatz stopping time is 54 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 273643

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,702,368

Proper Divisor Sum 11,493,078

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #8209277 ← → #8209297

Radix Representation

Decimal	8209290
Binary	11111010100001110001010 (23 bits)
Octal	0o37241612
Hexadecimal	0x7D438A

Divisor Catalog (16)

1 2 3 5 6 10 15 30 273,643 547,286 820,929 1,368,215 1,641,858 2,736,430 4,104,645 8,209,290

Collatz Trajectory (54 steps to reach 1)

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

8,209,290 4,104,645 12,313,936 6,156,968 3,078,484 1,539,242 769,621 2,308,864 1,154,432 577,216 288,608 144,304 72,152 36,076 18,038 9,019 27,058 13,529 40,588 20,294 10,147 30,442 15,221 45,664 22,832 11,416 5,708 2,854 1,427 4,282 2,141 6,424 3,212 1,606 803 2,410 1,205 3,616 1,808 904 452 226 113 340 170 85 256 128 64 32 16 8 4 2 1

← Previous Integer #8,209,289 Browse Full Index Next Integer #8,209,291 →