1,483,782

2 × 3 × 67 × 3691

1,483,782 factors as 2 × 3 × 67 × 3691. Its 16 positive divisors give a proper-divisor sum of 1,528,890, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2 × 3 × 67 × 3691

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,012,672

Proper Divisor Sum 1,528,890

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1483763 ← → #1483787

Radix Representation

Decimal	1483782
Binary	101101010010000000110 (21 bits)
Octal	0o5522006
Hexadecimal	0x16A406

Divisor Catalog (16)

1 2 3 6 67 134 201 402 3,691 7,382 11,073 22,146 247,297 494,594 741,891 1,483,782

Collatz Trajectory (93 steps to reach 1)

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

1,483,782 741,891 2,225,674 1,112,837 3,338,512 1,669,256 834,628 417,314 208,657 625,972 312,986 156,493 469,480 234,740 117,370 58,685 176,056 88,028 44,014 22,007 66,022 33,011 99,034 49,517 148,552 74,276 37,138 18,569 55,708 27,854 13,927 41,782 20,891 62,674 31,337 94,012 47,006 23,503 70,510 35,255 105,766 52,883 158,650 79,325 237,976 118,988 59,494 29,747 89,242 44,621 133,864 66,932 33,466 16,733 50,200 25,100 12,550 6,275 18,826 9,413

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,483,781 Browse Full Index Next Integer #1,483,783 →