7,747,896

2³ × 3 × 13 × 19 × 1307

7,747,896 factors as 2^3 × 3 × 13 × 19 × 1307. Its 64 positive divisors give a proper-divisor sum of 14,226,504, so this integer is abundant. The Collatz stopping time is 217 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 13 × 19 × 1307

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 21,974,400

Proper Divisor Sum 14,226,504

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #7747891 ← → #7747907

Radix Representation

Decimal	7747896
Binary	11101100011100100111000 (23 bits)
Octal	0o35434470
Hexadecimal	0x763938

Divisor Catalog (60 of 64)

1 2 3 4 6 8 12 13 19 24 26 38 39 52 57 76 78 104 114 152 156 228 247 312 456 494 741 988 1,307 1,482 1,976 2,614 2,964 3,921 5,228 5,928 7,842 10,456 15,684 16,991 24,833 31,368 33,982 49,666 50,973 67,964 74,499 99,332 101,946 135,928 148,998 198,664 203,892 297,996 322,829 407,784 595,992 645,658 968,487 1,291,316

Collatz Trajectory (217 steps to reach 1)

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

7,747,896 3,873,948 1,936,974 968,487 2,905,462 1,452,731 4,358,194 2,179,097 6,537,292 3,268,646 1,634,323 4,902,970 2,451,485 7,354,456 3,677,228 1,838,614 919,307 2,757,922 1,378,961 4,136,884 2,068,442 1,034,221 3,102,664 1,551,332 775,666 387,833 1,163,500 581,750 290,875 872,626 436,313 1,308,940 654,470 327,235 981,706 490,853 1,472,560 736,280 368,140 184,070 92,035 276,106 138,053 414,160 207,080 103,540 51,770 25,885 77,656 38,828 19,414 9,707 29,122 14,561 43,684 21,842 10,921 32,764 16,382 8,191

← Previous Integer #7,747,895 Browse Full Index Next Integer #7,747,897 →