913,808

2⁴ × 7 × 41 × 199

913,808 factors as 2^4 × 7 × 41 × 199. Its 40 positive divisors give a proper-divisor sum of 1,169,392, so this integer is abundant. The Collatz stopping time is 245 steps.

Prime Factor Structure

Factorization String 2^4 × 7 × 41 × 199

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 2,083,200

Proper Divisor Sum 1,169,392

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #913799 ← → #913811

Radix Representation

Decimal	913808
Binary	11011111000110010000 (20 bits)
Octal	0o3370620
Hexadecimal	0xDF190

Divisor Catalog (40)

1 2 4 7 8 14 16 28 41 56 82 112 164 199 287 328 398 574 656 796 1,148 1,393 1,592 2,296 2,786 3,184 4,592 5,572 8,159 11,144 16,318 22,288 32,636 57,113 65,272 114,226 130,544 228,452 456,904 913,808

Collatz Trajectory (245 steps to reach 1)

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

913,808 456,904 228,452 114,226 57,113 171,340 85,670 42,835 128,506 64,253 192,760 96,380 48,190 24,095 72,286 36,143 108,430 54,215 162,646 81,323 243,970 121,985 365,956 182,978 91,489 274,468 137,234 68,617 205,852 102,926 51,463 154,390 77,195 231,586 115,793 347,380 173,690 86,845 260,536 130,268 65,134 32,567 97,702 48,851 146,554 73,277 219,832 109,916 54,958 27,479 82,438 41,219 123,658 61,829 185,488 92,744 46,372 23,186 11,593 34,780

← Previous Integer #913,807 Browse Full Index Next Integer #913,809 →