6,761,448

2³ × 3³ × 23 × 1361

6,761,448 factors as 2^3 × 3^3 × 23 × 1361. Its 64 positive divisors give a proper-divisor sum of 12,851,352, so this integer is abundant. The Collatz stopping time is 178 steps.

Prime Factor Structure

Factorization String 2^3 × 3^3 × 23 × 1361

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 19,612,800

Proper Divisor Sum 12,851,352

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #6761411 ← → #6761453

Radix Representation

Decimal	6761448
Binary	11001110010101111101000 (23 bits)
Octal	0o31625750
Hexadecimal	0x672BE8

Divisor Catalog (60 of 64)

1 2 3 4 6 8 9 12 18 23 24 27 36 46 54 69 72 92 108 138 184 207 216 276 414 552 621 828 1,242 1,361 1,656 2,484 2,722 4,083 4,968 5,444 8,166 10,888 12,249 16,332 24,498 31,303 32,664 36,747 48,996 62,606 73,494 93,909 97,992 125,212 146,988 187,818 250,424 281,727 293,976 375,636 563,454 751,272 845,181 1,126,908

Collatz Trajectory (178 steps to reach 1)

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

6,761,448 3,380,724 1,690,362 845,181 2,535,544 1,267,772 633,886 316,943 950,830 475,415 1,426,246 713,123 2,139,370 1,069,685 3,209,056 1,604,528 802,264 401,132 200,566 100,283 300,850 150,425 451,276 225,638 112,819 338,458 169,229 507,688 253,844 126,922 63,461 190,384 95,192 47,596 23,798 11,899 35,698 17,849 53,548 26,774 13,387 40,162 20,081 60,244 30,122 15,061 45,184 22,592 11,296 5,648 2,824 1,412 706 353 1,060 530 265 796 398 199

← Previous Integer #6,761,447 Browse Full Index Next Integer #6,761,449 →