7,862,880

2⁵ × 3 × 5 × 16381

7,862,880 factors as 2^5 × 3 × 5 × 16381. Its 48 positive divisors give a proper-divisor sum of 16,906,704, so this integer is abundant. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 5 × 16381

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 24,769,584

Proper Divisor Sum 16,906,704

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #7862867 ← → #7862887

Radix Representation

Decimal	7862880
Binary	11101111111101001100000 (23 bits)
Octal	0o35775140
Hexadecimal	0x77FA60

Divisor Catalog (48)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 32 40 48 60 80 96 120 160 240 480 16,381 32,762 49,143 65,524 81,905 98,286 131,048 163,810 196,572 245,715 262,096 327,620 393,144 491,430 524,192 655,240 786,288 982,860 1,310,480 1,572,576 1,965,720 2,620,960 3,931,440 7,862,880

Collatz Trajectory (124 steps to reach 1)

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

7,862,880 3,931,440 1,965,720 982,860 491,430 245,715 737,146 368,573 1,105,720 552,860 276,430 138,215 414,646 207,323 621,970 310,985 932,956 466,478 233,239 699,718 349,859 1,049,578 524,789 1,574,368 787,184 393,592 196,796 98,398 49,199 147,598 73,799 221,398 110,699 332,098 166,049 498,148 249,074 124,537 373,612 186,806 93,403 280,210 140,105 420,316 210,158 105,079 315,238 157,619 472,858 236,429 709,288 354,644 177,322 88,661 265,984 132,992 66,496 33,248 16,624 8,312

← Previous Integer #7,862,879 Browse Full Index Next Integer #7,862,881 →