6,945,488

2⁴ × 11 × 19 × 31 × 67

6,945,488 factors as 2^4 × 11 × 19 × 31 × 67. Its 80 positive divisors give a proper-divisor sum of 9,243,952, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2^4 × 11 × 19 × 31 × 67

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 16,189,440

Proper Divisor Sum 9,243,952

Digit Sum / Digital Root 44 (Root: 8)

Adjacent Primes #6945481 ← → #6945509

Radix Representation

Decimal	6945488
Binary	11010011111101011010000 (23 bits)
Octal	0o32375320
Hexadecimal	0x69FAD0

Divisor Catalog (60 of 80)

1 2 4 8 11 16 19 22 31 38 44 62 67 76 88 124 134 152 176 209 248 268 304 341 418 496 536 589 682 737 836 1,072 1,178 1,273 1,364 1,474 1,672 2,077 2,356 2,546 2,728 2,948 3,344 4,154 4,712 5,092 5,456 5,896 6,479 8,308 9,424 10,184 11,792 12,958 14,003 16,616 20,368 22,847 25,916 28,006

Collatz Trajectory (129 steps to reach 1)

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

6,945,488 3,472,744 1,736,372 868,186 434,093 1,302,280 651,140 325,570 162,785 488,356 244,178 122,089 366,268 183,134 91,567 274,702 137,351 412,054 206,027 618,082 309,041 927,124 463,562 231,781 695,344 347,672 173,836 86,918 43,459 130,378 65,189 195,568 97,784 48,892 24,446 12,223 36,670 18,335 55,006 27,503 82,510 41,255 123,766 61,883 185,650 92,825 278,476 139,238 69,619 208,858 104,429 313,288 156,644 78,322 39,161 117,484 58,742 29,371 88,114 44,057

← Previous Integer #6,945,487 Browse Full Index Next Integer #6,945,489 →