403,840

2⁷ × 5 × 631

403,840 factors as 2^7 × 5 × 631. Its 32 positive divisors give a proper-divisor sum of 563,120, so this integer is abundant. The Collatz stopping time is 99 steps.

Prime Factor Structure

Factorization String 2^7 × 5 × 631

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 966,960

Proper Divisor Sum 563,120

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #403831 ← → #403849

Radix Representation

Decimal	403840
Binary	1100010100110000000 (19 bits)
Octal	0o1424600
Hexadecimal	0x62980

Divisor Catalog (32)

1 2 4 5 8 10 16 20 32 40 64 80 128 160 320 631 640 1,262 2,524 3,155 5,048 6,310 10,096 12,620 20,192 25,240 40,384 50,480 80,768 100,960 201,920 403,840

Collatz Trajectory (99 steps to reach 1)

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

403,840 201,920 100,960 50,480 25,240 12,620 6,310 3,155 9,466 4,733 14,200 7,100 3,550 1,775 5,326 2,663 7,990 3,995 11,986 5,993 17,980 8,990 4,495 13,486 6,743 20,230 10,115 30,346 15,173 45,520 22,760 11,380 5,690 2,845 8,536 4,268 2,134 1,067 3,202 1,601 4,804 2,402 1,201 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287 862 431

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #403,839 Browse Full Index Next Integer #403,841 →