6,493,812

2² × 3 × 13 × 41627

6,493,812 factors as 2^2 × 3 × 13 × 41627. Its 24 positive divisors give a proper-divisor sum of 9,824,364, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 13 × 41627

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 16,318,176

Proper Divisor Sum 9,824,364

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6493793 ← → #6493819

Radix Representation

Decimal	6493812
Binary	11000110001011001110100 (23 bits)
Octal	0o30613164
Hexadecimal	0x631674

Divisor Catalog (24)

1 2 3 4 6 12 13 26 39 52 78 156 41,627 83,254 124,881 166,508 249,762 499,524 541,151 1,082,302 1,623,453 2,164,604 3,246,906 6,493,812

Collatz Trajectory (121 steps to reach 1)

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

6,493,812 3,246,906 1,623,453 4,870,360 2,435,180 1,217,590 608,795 1,826,386 913,193 2,739,580 1,369,790 684,895 2,054,686 1,027,343 3,082,030 1,541,015 4,623,046 2,311,523 6,934,570 3,467,285 10,401,856 5,200,928 2,600,464 1,300,232 650,116 325,058 162,529 487,588 243,794 121,897 365,692 182,846 91,423 274,270 137,135 411,406 205,703 617,110 308,555 925,666 462,833 1,388,500 694,250 347,125 1,041,376 520,688 260,344 130,172 65,086 32,543 97,630 48,815 146,446 73,223 219,670 109,835 329,506 164,753 494,260 247,130

← Previous Integer #6,493,811 Browse Full Index Next Integer #6,493,813 →