804,310

2 × 5 × 13 × 23 × 269

804,310 factors as 2 × 5 × 13 × 23 × 269. Its 32 positive divisors give a proper-divisor sum of 828,650, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2 × 5 × 13 × 23 × 269

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 1,632,960

Proper Divisor Sum 828,650

Digit Sum / Digital Root 16 (Root: 7)

Adjacent Primes #804283 ← → #804313

Radix Representation

Decimal	804310
Binary	11000100010111010110 (20 bits)
Octal	0o3042726
Hexadecimal	0xC45D6

Divisor Catalog (32)

1 2 5 10 13 23 26 46 65 115 130 230 269 299 538 598 1,345 1,495 2,690 2,990 3,497 6,187 6,994 12,374 17,485 30,935 34,970 61,870 80,431 160,862 402,155 804,310

Collatz Trajectory (69 steps to reach 1)

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

804,310 402,155 1,206,466 603,233 1,809,700 904,850 452,425 1,357,276 678,638 339,319 1,017,958 508,979 1,526,938 763,469 2,290,408 1,145,204 572,602 286,301 858,904 429,452 214,726 107,363 322,090 161,045 483,136 241,568 120,784 60,392 30,196 15,098 7,549 22,648 11,324 5,662 2,831 8,494 4,247 12,742 6,371 19,114 9,557 28,672 14,336 7,168 3,584 1,792 896 448 224 112 56 28 14 7 22 11 34 17 52 26

← Previous Integer #804,309 Browse Full Index Next Integer #804,311 →