6,499,990

2 × 5 × 7 × 92857

6,499,990 factors as 2 × 5 × 7 × 92857. Its 16 positive divisors give a proper-divisor sum of 6,871,562, so this integer is abundant. The Collatz stopping time is 64 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 92857

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 13,371,552

Proper Divisor Sum 6,871,562

Digit Sum / Digital Root 46 (Root: 1)

Adjacent Primes #6499949 ← → #6499991

Radix Representation

Decimal	6499990
Binary	11000110010111010010110 (23 bits)
Octal	0o30627226
Hexadecimal	0x632E96

Divisor Catalog (16)

1 2 5 7 10 14 35 70 92,857 185,714 464,285 649,999 928,570 1,299,998 3,249,995 6,499,990

Collatz Trajectory (64 steps to reach 1)

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

6,499,990 3,249,995 9,749,986 4,874,993 14,624,980 7,312,490 3,656,245 10,968,736 5,484,368 2,742,184 1,371,092 685,546 342,773 1,028,320 514,160 257,080 128,540 64,270 32,135 96,406 48,203 144,610 72,305 216,916 108,458 54,229 162,688 81,344 40,672 20,336 10,168 5,084 2,542 1,271 3,814 1,907 5,722 2,861 8,584 4,292 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024 512 256 128 64 32

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,499,989 Browse Full Index Next Integer #6,499,991 →