5,209,060

2² × 5 × 260453

5,209,060 factors as 2^2 × 5 × 260453. Its 12 positive divisors give a proper-divisor sum of 5,730,008, so this integer is abundant. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 260453

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,939,068

Proper Divisor Sum 5,730,008

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #5209031 ← → #5209069

Radix Representation

Decimal	5209060
Binary	10011110111101111100100 (23 bits)
Octal	0o23675744
Hexadecimal	0x4F7BE4

Divisor Catalog (12)

1 2 4 5 10 20 260,453 520,906 1,041,812 1,302,265 2,604,530 5,209,060

Collatz Trajectory (82 steps to reach 1)

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

5,209,060 2,604,530 1,302,265 3,906,796 1,953,398 976,699 2,930,098 1,465,049 4,395,148 2,197,574 1,098,787 3,296,362 1,648,181 4,944,544 2,472,272 1,236,136 618,068 309,034 154,517 463,552 231,776 115,888 57,944 28,972 14,486 7,243 21,730 10,865 32,596 16,298 8,149 24,448 12,224 6,112 3,056 1,528 764 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640 820 410 205 616 308 154

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,209,059 Browse Full Index Next Integer #5,209,061 →