5,756,034

2 × 3 × 959339

5,756,034 factors as 2 × 3 × 959339. Its 8 positive divisors give a proper-divisor sum of 5,756,046, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2 × 3 × 959339

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 11,512,080

Proper Divisor Sum 5,756,046

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5756027 ← → #5756059

Radix Representation

Decimal	5756034
Binary	10101111101010010000010 (23 bits)
Octal	0o25752202
Hexadecimal	0x57D482

Divisor Catalog (8)

1 2 3 6 959,339 1,918,678 2,878,017 5,756,034

Collatz Trajectory (108 steps to reach 1)

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

5,756,034 2,878,017 8,634,052 4,317,026 2,158,513 6,475,540 3,237,770 1,618,885 4,856,656 2,428,328 1,214,164 607,082 303,541 910,624 455,312 227,656 113,828 56,914 28,457 85,372 42,686 21,343 64,030 32,015 96,046 48,023 144,070 72,035 216,106 108,053 324,160 162,080 81,040 40,520 20,260 10,130 5,065 15,196 7,598 3,799 11,398 5,699 17,098 8,549 25,648 12,824 6,412 3,206 1,603 4,810 2,405 7,216 3,608 1,804 902 451 1,354 677 2,032 1,016

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,756,033 Browse Full Index Next Integer #5,756,035 →