984,152

2³ × 13 × 9463

984,152 factors as 2^3 × 13 × 9463. Its 16 positive divisors give a proper-divisor sum of 1,003,288, so this integer is abundant. The Collatz stopping time is 64 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 9463

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,987,440

Proper Divisor Sum 1,003,288

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #984149 ← → #984167

Radix Representation

Decimal	984152
Binary	11110000010001011000 (20 bits)
Octal	0o3602130
Hexadecimal	0xF0458

Divisor Catalog (16)

1 2 4 8 13 26 52 104 9,463 18,926 37,852 75,704 123,019 246,038 492,076 984,152

Collatz Trajectory (64 steps to reach 1)

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

984,152 492,076 246,038 123,019 369,058 184,529 553,588 276,794 138,397 415,192 207,596 103,798 51,899 155,698 77,849 233,548 116,774 58,387 175,162 87,581 262,744 131,372 65,686 32,843 98,530 49,265 147,796 73,898 36,949 110,848 55,424 27,712 13,856 6,928 3,464 1,732 866 433 1,300 650 325 976 488 244 122 61 184 92 46 23 70 35 106 53 160 80 40 20 10 5

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #984,151 Browse Full Index Next Integer #984,153 →