6,836,730

2 × 3 × 5 × 281 × 811

6,836,730 factors as 2 × 3 × 5 × 281 × 811. Its 32 positive divisors give a proper-divisor sum of 9,650,118, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 281 × 811

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 16,486,848

Proper Divisor Sum 9,650,118

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6836729 ← → #6836741

Radix Representation

Decimal	6836730
Binary	11010000101000111111010 (23 bits)
Octal	0o32050772
Hexadecimal	0x6851FA

Divisor Catalog (32)

Collatz Trajectory (147 steps to reach 1)

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

6,836,730 3,418,365 10,255,096 5,127,548 2,563,774 1,281,887 3,845,662 1,922,831 5,768,494 2,884,247 8,652,742 4,326,371 12,979,114 6,489,557 19,468,672 9,734,336 4,867,168 2,433,584 1,216,792 608,396 304,198 152,099 456,298 228,149 684,448 342,224 171,112 85,556 42,778 21,389 64,168 32,084 16,042 8,021 24,064 12,032 6,016 3,008 1,504 752 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,836,729 Browse Full Index Next Integer #6,836,731 →