1,390,386

2 × 3 × 37 × 6263

1,390,386 factors as 2 × 3 × 37 × 6263. Its 16 positive divisors give a proper-divisor sum of 1,465,998, so this integer is abundant. The Collatz stopping time is 230 steps.

Prime Factor Structure

Factorization String 2 × 3 × 37 × 6263

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,856,384

Proper Divisor Sum 1,465,998

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1390369 ← → #1390387

Radix Representation

Decimal	1390386
Binary	101010011011100110010 (21 bits)
Octal	0o5233462
Hexadecimal	0x153732

Divisor Catalog (16)

1 2 3 6 37 74 111 222 6,263 12,526 18,789 37,578 231,731 463,462 695,193 1,390,386

Collatz Trajectory (230 steps to reach 1)

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

1,390,386 695,193 2,085,580 1,042,790 521,395 1,564,186 782,093 2,346,280 1,173,140 586,570 293,285 879,856 439,928 219,964 109,982 54,991 164,974 82,487 247,462 123,731 371,194 185,597 556,792 278,396 139,198 69,599 208,798 104,399 313,198 156,599 469,798 234,899 704,698 352,349 1,057,048 528,524 264,262 132,131 396,394 198,197 594,592 297,296 148,648 74,324 37,162 18,581 55,744 27,872 13,936 6,968 3,484 1,742 871 2,614 1,307 3,922 1,961 5,884 2,942 1,471

← Previous Integer #1,390,385 Browse Full Index Next Integer #1,390,387 →