392,478

2 × 3 × 65413

392,478 factors as 2 × 3 × 65413. Its 8 positive divisors give a proper-divisor sum of 392,490, so this integer is abundant. The Collatz stopping time is 148 steps.

Prime Factor Structure

Factorization String 2 × 3 × 65413

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 784,968

Proper Divisor Sum 392,490

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #392477 ← → #392489

Radix Representation

Decimal	392478
Binary	1011111110100011110 (19 bits)
Octal	0o1376436
Hexadecimal	0x5FD1E

Divisor Catalog (8)

1 2 3 6 65,413 130,826 196,239 392,478

Collatz Trajectory (148 steps to reach 1)

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

392,478 196,239 588,718 294,359 883,078 441,539 1,324,618 662,309 1,986,928 993,464 496,732 248,366 124,183 372,550 186,275 558,826 279,413 838,240 419,120 209,560 104,780 52,390 26,195 78,586 39,293 117,880 58,940 29,470 14,735 44,206 22,103 66,310 33,155 99,466 49,733 149,200 74,600 37,300 18,650 9,325 27,976 13,988 6,994 3,497 10,492 5,246 2,623 7,870 3,935 11,806 5,903 17,710 8,855 26,566 13,283 39,850 19,925 59,776 29,888 14,944

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #392,477 Browse Full Index Next Integer #392,479 →