1,387,464

2³ × 3 × 13 × 4447

1,387,464 factors as 2^3 × 3 × 13 × 4447. Its 32 positive divisors give a proper-divisor sum of 2,348,856, so this integer is abundant. The Collatz stopping time is 137 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 13 × 4447

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 3,736,320

Proper Divisor Sum 2,348,856

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1387433 ← → #1387499

Radix Representation

Decimal	1387464
Binary	101010010101111001000 (21 bits)
Octal	0o5225710
Hexadecimal	0x152BC8

Divisor Catalog (32)

Collatz Trajectory (137 steps to reach 1)

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

1,387,464 693,732 346,866 173,433 520,300 260,150 130,075 390,226 195,113 585,340 292,670 146,335 439,006 219,503 658,510 329,255 987,766 493,883 1,481,650 740,825 2,222,476 1,111,238 555,619 1,666,858 833,429 2,500,288 1,250,144 625,072 312,536 156,268 78,134 39,067 117,202 58,601 175,804 87,902 43,951 131,854 65,927 197,782 98,891 296,674 148,337 445,012 222,506 111,253 333,760 166,880 83,440 41,720 20,860 10,430 5,215 15,646 7,823 23,470 11,735 35,206 17,603 52,810

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,387,463 Browse Full Index Next Integer #1,387,465 →