3,133,554

2 × 3 × 522259

3,133,554 factors as 2 × 3 × 522259. Its 8 positive divisors give a proper-divisor sum of 3,133,566, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2 × 3 × 522259

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,267,120

Proper Divisor Sum 3,133,566

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3133547 ← → #3133583

Radix Representation

Decimal	3133554
Binary	1011111101000001110010 (22 bits)
Octal	0o13750162
Hexadecimal	0x2FD072

Divisor Catalog (8)

1 2 3 6 522,259 1,044,518 1,566,777 3,133,554

Collatz Trajectory (164 steps to reach 1)

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

3,133,554 1,566,777 4,700,332 2,350,166 1,175,083 3,525,250 1,762,625 5,287,876 2,643,938 1,321,969 3,965,908 1,982,954 991,477 2,974,432 1,487,216 743,608 371,804 185,902 92,951 278,854 139,427 418,282 209,141 627,424 313,712 156,856 78,428 39,214 19,607 58,822 29,411 88,234 44,117 132,352 66,176 33,088 16,544 8,272 4,136 2,068 1,034 517 1,552 776 388 194 97 292 146 73 220 110 55 166 83 250 125 376 188 94

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,133,553 Browse Full Index Next Integer #3,133,555 →