694,408

2³ × 11 × 13 × 607

694,408 factors as 2^3 × 11 × 13 × 607. Its 32 positive divisors give a proper-divisor sum of 837,752, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 13 × 607

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 1,532,160

Proper Divisor Sum 837,752

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #694391 ← → #694409

Radix Representation

Decimal	694408
Binary	10101001100010001000 (20 bits)
Octal	0o2514210
Hexadecimal	0xA9888

Divisor Catalog (32)

1 2 4 8 11 13 22 26 44 52 88 104 143 286 572 607 1,144 1,214 2,428 4,856 6,677 7,891 13,354 15,782 26,708 31,564 53,416 63,128 86,801 173,602 347,204 694,408

Collatz Trajectory (167 steps to reach 1)

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

694,408 347,204 173,602 86,801 260,404 130,202 65,101 195,304 97,652 48,826 24,413 73,240 36,620 18,310 9,155 27,466 13,733 41,200 20,600 10,300 5,150 2,575 7,726 3,863 11,590 5,795 17,386 8,693 26,080 13,040 6,520 3,260 1,630 815 2,446 1,223 3,670 1,835 5,506 2,753 8,260 4,130 2,065 6,196 3,098 1,549 4,648 2,324 1,162 581 1,744 872 436 218 109 328 164 82 41 124

← Previous Integer #694,407 Browse Full Index Next Integer #694,409 →