1,493,604

2² × 3² × 7 × 5927

1,493,604 factors as 2^2 × 3^2 × 7 × 5927. Its 36 positive divisors give a proper-divisor sum of 2,821,980, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 7 × 5927

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 4,315,584

Proper Divisor Sum 2,821,980

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1493599 ← → #1493617

Radix Representation

Decimal	1493604
Binary	101101100101001100100 (21 bits)
Octal	0o5545144
Hexadecimal	0x16CA64

Divisor Catalog (36)

1 2 3 4 6 7 9 12 14 18 21 28 36 42 63 84 126 252 5,927 11,854 17,781 23,708 35,562 41,489 53,343 71,124 82,978 106,686 124,467 165,956 213,372 248,934 373,401 497,868 746,802 1,493,604

Collatz Trajectory (88 steps to reach 1)

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

1,493,604 746,802 373,401 1,120,204 560,102 280,051 840,154 420,077 1,260,232 630,116 315,058 157,529 472,588 236,294 118,147 354,442 177,221 531,664 265,832 132,916 66,458 33,229 99,688 49,844 24,922 12,461 37,384 18,692 9,346 4,673 14,020 7,010 3,505 10,516 5,258 2,629 7,888 3,944 1,972 986 493 1,480 740 370 185 556 278 139 418 209 628 314 157 472 236 118 59 178 89 268

← Previous Integer #1,493,603 Browse Full Index Next Integer #1,493,605 →