5,638,854

2 × 3 × 13² × 67 × 83

5,638,854 factors as 2 × 3 × 13^2 × 67 × 83. Its 48 positive divisors give a proper-divisor sum of 6,904,698, so this integer is abundant. The Collatz stopping time is 77 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13^2 × 67 × 83

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 12,543,552

Proper Divisor Sum 6,904,698

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #5638823 ← → #5638859

Radix Representation

Decimal	5638854
Binary	10101100000101011000110 (23 bits)
Octal	0o25405306
Hexadecimal	0x560AC6

Divisor Catalog (48)

1 2 3 6 13 26 39 67 78 83 134 166 169 201 249 338 402 498 507 871 1,014 1,079 1,742 2,158 2,613 3,237 5,226 5,561 6,474 11,122 11,323 14,027 16,683 22,646 28,054 33,366 33,969 42,081 67,938 72,293 84,162 144,586 216,879 433,758 939,809 1,879,618 2,819,427 5,638,854

Collatz Trajectory (77 steps to reach 1)

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

5,638,854 2,819,427 8,458,282 4,229,141 12,687,424 6,343,712 3,171,856 1,585,928 792,964 396,482 198,241 594,724 297,362 148,681 446,044 223,022 111,511 334,534 167,267 501,802 250,901 752,704 376,352 188,176 94,088 47,044 23,522 11,761 35,284 17,642 8,821 26,464 13,232 6,616 3,308 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192 2,096 1,048 524 262 131 394 197 592 296 148 74 37 112 56 28

← Previous Integer #5,638,853 Browse Full Index Next Integer #5,638,855 →