4,605,234

2 × 3 × 767539

4,605,234 factors as 2 × 3 × 767539. Its 8 positive divisors give a proper-divisor sum of 4,605,246, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2 × 3 × 767539

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,210,480

Proper Divisor Sum 4,605,246

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4605217 ← → #4605241

Radix Representation

Decimal	4605234
Binary	10001100100010100110010 (23 bits)
Octal	0o21442462
Hexadecimal	0x464532

Divisor Catalog (8)

1 2 3 6 767,539 1,535,078 2,302,617 4,605,234

Collatz Trajectory (100 steps to reach 1)

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

4,605,234 2,302,617 6,907,852 3,453,926 1,726,963 5,180,890 2,590,445 7,771,336 3,885,668 1,942,834 971,417 2,914,252 1,457,126 728,563 2,185,690 1,092,845 3,278,536 1,639,268 819,634 409,817 1,229,452 614,726 307,363 922,090 461,045 1,383,136 691,568 345,784 172,892 86,446 43,223 129,670 64,835 194,506 97,253 291,760 145,880 72,940 36,470 18,235 54,706 27,353 82,060 41,030 20,515 61,546 30,773 92,320 46,160 23,080 11,540 5,770 2,885 8,656 4,328 2,164 1,082 541 1,624 812

← Previous Integer #4,605,233 Browse Full Index Next Integer #4,605,235 →