4,824,342

2 × 3² × 23 × 43 × 271

4,824,342 factors as 2 × 3^2 × 23 × 43 × 271. Its 48 positive divisors give a proper-divisor sum of 6,377,706, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 23 × 43 × 271

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 11,202,048

Proper Divisor Sum 6,377,706

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4824331 ← → #4824359

Radix Representation

Decimal	4824342
Binary	10010011001110100010110 (23 bits)
Octal	0o22316426
Hexadecimal	0x499D16

Divisor Catalog (48)

1 2 3 6 9 18 23 43 46 69 86 129 138 207 258 271 387 414 542 774 813 989 1,626 1,978 2,439 2,967 4,878 5,934 6,233 8,901 11,653 12,466 17,802 18,699 23,306 34,959 37,398 56,097 69,918 104,877 112,194 209,754 268,019 536,038 804,057 1,608,114 2,412,171 4,824,342

Collatz Trajectory (69 steps to reach 1)

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

4,824,342 2,412,171 7,236,514 3,618,257 10,854,772 5,427,386 2,713,693 8,141,080 4,070,540 2,035,270 1,017,635 3,052,906 1,526,453 4,579,360 2,289,680 1,144,840 572,420 286,210 143,105 429,316 214,658 107,329 321,988 160,994 80,497 241,492 120,746 60,373 181,120 90,560 45,280 22,640 11,320 5,660 2,830 1,415 4,246 2,123 6,370 3,185 9,556 4,778 2,389 7,168 3,584 1,792 896 448 224 112 56 28 14 7 22 11 34 17 52 26

← Previous Integer #4,824,341 Browse Full Index Next Integer #4,824,343 →