495,960

2³ × 3 × 5 × 4133

495,960 factors as 2^3 × 3 × 5 × 4133. Its 32 positive divisors give a proper-divisor sum of 992,280, so this integer is abundant. The Collatz stopping time is 58 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 4133

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 1,488,240

Proper Divisor Sum 992,280

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #495959 ← → #495967

Radix Representation

Decimal	495960
Binary	1111001000101011000 (19 bits)
Octal	0o1710530
Hexadecimal	0x79158

Divisor Catalog (32)

1 2 3 4 5 6 8 10 12 15 20 24 30 40 60 120 4,133 8,266 12,399 16,532 20,665 24,798 33,064 41,330 49,596 61,995 82,660 99,192 123,990 165,320 247,980 495,960

Collatz Trajectory (58 steps to reach 1)

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

495,960 247,980 123,990 61,995 185,986 92,993 278,980 139,490 69,745 209,236 104,618 52,309 156,928 78,464 39,232 19,616 9,808 4,904 2,452 1,226 613 1,840 920 460 230 115 346 173 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #495,959 Browse Full Index Next Integer #495,961 →