6,299,652

2² × 3 × 524971

6,299,652 factors as 2^2 × 3 × 524971. Its 12 positive divisors give a proper-divisor sum of 8,399,564, so this integer is abundant. The Collatz stopping time is 103 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 524971

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 14,699,216

Proper Divisor Sum 8,399,564

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6299651 ← → #6299663

Radix Representation

Decimal	6299652
Binary	11000000010000000000100 (23 bits)
Octal	0o30020004
Hexadecimal	0x602004

Divisor Catalog (12)

1 2 3 4 6 12 524,971 1,049,942 1,574,913 2,099,884 3,149,826 6,299,652

Collatz Trajectory (103 steps to reach 1)

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

6,299,652 3,149,826 1,574,913 4,724,740 2,362,370 1,181,185 3,543,556 1,771,778 885,889 2,657,668 1,328,834 664,417 1,993,252 996,626 498,313 1,494,940 747,470 373,735 1,121,206 560,603 1,681,810 840,905 2,522,716 1,261,358 630,679 1,892,038 946,019 2,838,058 1,419,029 4,257,088 2,128,544 1,064,272 532,136 266,068 133,034 66,517 199,552 99,776 49,888 24,944 12,472 6,236 3,118 1,559 4,678 2,339 7,018 3,509 10,528 5,264 2,632 1,316 658 329 988 494 247 742 371 1,114

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,299,651 Browse Full Index Next Integer #6,299,653 →