4,622,676

2² × 3 × 385223

4,622,676 factors as 2^2 × 3 × 385223. Its 12 positive divisors give a proper-divisor sum of 6,163,596, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 385223

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,786,272

Proper Divisor Sum 6,163,596

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4622671 ← → #4622677

Radix Representation

Decimal	4622676
Binary	10001101000100101010100 (23 bits)
Octal	0o21504524
Hexadecimal	0x468954

Divisor Catalog (12)

1 2 3 4 6 12 385,223 770,446 1,155,669 1,540,892 2,311,338 4,622,676

Collatz Trajectory (105 steps to reach 1)

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

4,622,676 2,311,338 1,155,669 3,467,008 1,733,504 866,752 433,376 216,688 108,344 54,172 27,086 13,543 40,630 20,315 60,946 30,473 91,420 45,710 22,855 68,566 34,283 102,850 51,425 154,276 77,138 38,569 115,708 57,854 28,927 86,782 43,391 130,174 65,087 195,262 97,631 292,894 146,447 439,342 219,671 659,014 329,507 988,522 494,261 1,482,784 741,392 370,696 185,348 92,674 46,337 139,012 69,506 34,753 104,260 52,130 26,065 78,196 39,098 19,549 58,648 29,324

← Previous Integer #4,622,675 Browse Full Index Next Integer #4,622,677 →