6,315,222

2 × 3 × 1052537

6,315,222 factors as 2 × 3 × 1052537. Its 8 positive divisors give a proper-divisor sum of 6,315,234, so this integer is abundant. The Collatz stopping time is 227 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1052537

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,630,456

Proper Divisor Sum 6,315,234

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #6315217 ← → #6315223

Radix Representation

Decimal	6315222
Binary	11000000101110011010110 (23 bits)
Octal	0o30056326
Hexadecimal	0x605CD6

Divisor Catalog (8)

1 2 3 6 1,052,537 2,105,074 3,157,611 6,315,222

Collatz Trajectory (227 steps to reach 1)

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

6,315,222 3,157,611 9,472,834 4,736,417 14,209,252 7,104,626 3,552,313 10,656,940 5,328,470 2,664,235 7,992,706 3,996,353 11,989,060 5,994,530 2,997,265 8,991,796 4,495,898 2,247,949 6,743,848 3,371,924 1,685,962 842,981 2,528,944 1,264,472 632,236 316,118 158,059 474,178 237,089 711,268 355,634 177,817 533,452 266,726 133,363 400,090 200,045 600,136 300,068 150,034 75,017 225,052 112,526 56,263 168,790 84,395 253,186 126,593 379,780 189,890 94,945 284,836 142,418 71,209 213,628 106,814 53,407 160,222 80,111 240,334

← Previous Integer #6,315,221 Browse Full Index Next Integer #6,315,223 →