5,699,672

2³ × 11 × 239 × 271

5,699,672 factors as 2^3 × 11 × 239 × 271. Its 32 positive divisors give a proper-divisor sum of 6,050,728, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 239 × 271

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 11,750,400

Proper Divisor Sum 6,050,728

Digit Sum / Digital Root 44 (Root: 8)

Adjacent Primes #5699669 ← → #5699713

Radix Representation

Decimal	5699672
Binary	10101101111100001011000 (23 bits)
Octal	0o25574130
Hexadecimal	0x56F858

Divisor Catalog (32)

1 2 4 8 11 22 44 88 239 271 478 542 956 1,084 1,912 2,168 2,629 2,981 5,258 5,962 10,516 11,924 21,032 23,848 64,769 129,538 259,076 518,152 712,459 1,424,918 2,849,836 5,699,672

Collatz Trajectory (139 steps to reach 1)

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

5,699,672 2,849,836 1,424,918 712,459 2,137,378 1,068,689 3,206,068 1,603,034 801,517 2,404,552 1,202,276 601,138 300,569 901,708 450,854 225,427 676,282 338,141 1,014,424 507,212 253,606 126,803 380,410 190,205 570,616 285,308 142,654 71,327 213,982 106,991 320,974 160,487 481,462 240,731 722,194 361,097 1,083,292 541,646 270,823 812,470 406,235 1,218,706 609,353 1,828,060 914,030 457,015 1,371,046 685,523 2,056,570 1,028,285 3,084,856 1,542,428 771,214 385,607 1,156,822 578,411 1,735,234 867,617 2,602,852 1,301,426

← Previous Integer #5,699,671 Browse Full Index Next Integer #5,699,673 →