4,890,384

2⁴ × 3² × 33961

4,890,384 factors as 2^4 × 3^2 × 33961. Its 30 positive divisors give a proper-divisor sum of 8,796,302, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2^4 × 3^2 × 33961

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 30

Divisor Sum (σ) 13,686,686

Proper Divisor Sum 8,796,302

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4890383 ← → #4890419

Radix Representation

Decimal	4890384
Binary	10010101001111100010000 (23 bits)
Octal	0o22517420
Hexadecimal	0x4A9F10

Divisor Catalog (30)

1 2 3 4 6 8 9 12 16 18 24 36 48 72 144 33,961 67,922 101,883 135,844 203,766 271,688 305,649 407,532 543,376 611,298 815,064 1,222,596 1,630,128 2,445,192 4,890,384

Collatz Trajectory (69 steps to reach 1)

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

4,890,384 2,445,192 1,222,596 611,298 305,649 916,948 458,474 229,237 687,712 343,856 171,928 85,964 42,982 21,491 64,474 32,237 96,712 48,356 24,178 12,089 36,268 18,134 9,067 27,202 13,601 40,804 20,402 10,201 30,604 15,302 7,651 22,954 11,477 34,432 17,216 8,608 4,304 2,152 1,076 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26

← Previous Integer #4,890,383 Browse Full Index Next Integer #4,890,385 →