2,285,296

2⁴ × 13 × 10987

2,285,296 factors as 2^4 × 13 × 10987. Its 20 positive divisors give a proper-divisor sum of 2,483,496, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2^4 × 13 × 10987

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 4,768,792

Proper Divisor Sum 2,483,496

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #2285291 ← → #2285317

Radix Representation

Decimal	2285296
Binary	1000101101111011110000 (22 bits)
Octal	0o10557360
Hexadecimal	0x22DEF0

Divisor Catalog (20)

Collatz Trajectory (86 steps to reach 1)

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

2,285,296 1,142,648 571,324 285,662 142,831 428,494 214,247 642,742 321,371 964,114 482,057 1,446,172 723,086 361,543 1,084,630 542,315 1,626,946 813,473 2,440,420 1,220,210 610,105 1,830,316 915,158 457,579 1,372,738 686,369 2,059,108 1,029,554 514,777 1,544,332 772,166 386,083 1,158,250 579,125 1,737,376 868,688 434,344 217,172 108,586 54,293 162,880 81,440 40,720 20,360 10,180 5,090 2,545 7,636 3,818 1,909 5,728 2,864 1,432 716 358 179 538 269 808 404

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,285,295 Browse Full Index Next Integer #2,285,297 →