6,282,462

2 × 3 × 1047077

6,282,462 factors as 2 × 3 × 1047077. Its 8 positive divisors give a proper-divisor sum of 6,282,474, so this integer is abundant. The Collatz stopping time is 258 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1047077

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,564,936

Proper Divisor Sum 6,282,474

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6282457 ← → #6282481

Radix Representation

Decimal	6282462
Binary	10111111101110011011110 (23 bits)
Octal	0o27756336
Hexadecimal	0x5FDCDE

Divisor Catalog (8)

1 2 3 6 1,047,077 2,094,154 3,141,231 6,282,462

Collatz Trajectory (258 steps to reach 1)

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

6,282,462 3,141,231 9,423,694 4,711,847 14,135,542 7,067,771 21,203,314 10,601,657 31,804,972 15,902,486 7,951,243 23,853,730 11,926,865 35,780,596 17,890,298 8,945,149 26,835,448 13,417,724 6,708,862 3,354,431 10,063,294 5,031,647 15,094,942 7,547,471 22,642,414 11,321,207 33,963,622 16,981,811 50,945,434 25,472,717 76,418,152 38,209,076 19,104,538 9,552,269 28,656,808 14,328,404 7,164,202 3,582,101 10,746,304 5,373,152 2,686,576 1,343,288 671,644 335,822 167,911 503,734 251,867 755,602 377,801 1,133,404 566,702 283,351 850,054 425,027 1,275,082 637,541 1,912,624 956,312 478,156 239,078

← Previous Integer #6,282,461 Browse Full Index Next Integer #6,282,463 →