3,710,136

2³ × 3 × 154589

3,710,136 factors as 2^3 × 3 × 154589. Its 16 positive divisors give a proper-divisor sum of 5,565,264, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 154589

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,275,400

Proper Divisor Sum 5,565,264

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3710123 ← → #3710137

Radix Representation

Decimal	3710136
Binary	1110001001110010111000 (22 bits)
Octal	0o16116270
Hexadecimal	0x389CB8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 154,589 309,178 463,767 618,356 927,534 1,236,712 1,855,068 3,710,136

Collatz Trajectory (172 steps to reach 1)

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

3,710,136 1,855,068 927,534 463,767 1,391,302 695,651 2,086,954 1,043,477 3,130,432 1,565,216 782,608 391,304 195,652 97,826 48,913 146,740 73,370 36,685 110,056 55,028 27,514 13,757 41,272 20,636 10,318 5,159 15,478 7,739 23,218 11,609 34,828 17,414 8,707 26,122 13,061 39,184 19,592 9,796 4,898 2,449 7,348 3,674 1,837 5,512 2,756 1,378 689 2,068 1,034 517 1,552 776 388 194 97 292 146 73 220 110

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,710,135 Browse Full Index Next Integer #3,710,137 →