6,448,314

2 × 3 × 1074719

6,448,314 factors as 2 × 3 × 1074719. Its 8 positive divisors give a proper-divisor sum of 6,448,326, so this integer is abundant. The Collatz stopping time is 72 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1074719

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,896,640

Proper Divisor Sum 6,448,326

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6448307 ← → #6448319

Radix Representation

Decimal	6448314
Binary	11000100110010010111010 (23 bits)
Octal	0o30462272
Hexadecimal	0x6264BA

Divisor Catalog (8)

1 2 3 6 1,074,719 2,149,438 3,224,157 6,448,314

Collatz Trajectory (72 steps to reach 1)

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

6,448,314 3,224,157 9,672,472 4,836,236 2,418,118 1,209,059 3,627,178 1,813,589 5,440,768 2,720,384 1,360,192 680,096 340,048 170,024 85,012 42,506 21,253 63,760 31,880 15,940 7,970 3,985 11,956 5,978 2,989 8,968 4,484 2,242 1,121 3,364 1,682 841 2,524 1,262 631 1,894 947 2,842 1,421 4,264 2,132 1,066 533 1,600 800 400 200 100 50 25 76 38 19 58 29 88 44 22 11 34

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,448,313 Browse Full Index Next Integer #6,448,315 →