6,926,472

2³ × 3⁵ × 7 × 509

6,926,472 factors as 2^3 × 3^5 × 7 × 509. Its 96 positive divisors give a proper-divisor sum of 15,350,328, so this integer is abundant. The Collatz stopping time is 46 steps.

Prime Factor Structure

Factorization String 2^3 × 3^5 × 7 × 509

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 22,276,800

Proper Divisor Sum 15,350,328

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #6926471 ← → #6926501

Radix Representation

Decimal	6926472
Binary	11010011011000010001000 (23 bits)
Octal	0o32330210
Hexadecimal	0x69B088

Divisor Catalog (60 of 96)

1 2 3 4 6 7 8 9 12 14 18 21 24 27 28 36 42 54 56 63 72 81 84 108 126 162 168 189 216 243 252 324 378 486 504 509 567 648 756 972 1,018 1,134 1,512 1,527 1,701 1,944 2,036 2,268 3,054 3,402 3,563 4,072 4,536 4,581 6,108 6,804 7,126 9,162 10,689 12,216

Collatz Trajectory (46 steps to reach 1)

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

6,926,472 3,463,236 1,731,618 865,809 2,597,428 1,298,714 649,357 1,948,072 974,036 487,018 243,509 730,528 365,264 182,632 91,316 45,658 22,829 68,488 34,244 17,122 8,561 25,684 12,842 6,421 19,264 9,632 4,816 2,408 1,204 602 301 904 452 226 113 340 170 85 256 128 64 32 16 8 4 2 1

← Previous Integer #6,926,471 Browse Full Index Next Integer #6,926,473 →