4,233,018

2 × 3 × 89 × 7927

4,233,018 factors as 2 × 3 × 89 × 7927. Its 16 positive divisors give a proper-divisor sum of 4,329,222, so this integer is abundant. The Collatz stopping time is 273 steps.

Prime Factor Structure

Factorization String 2 × 3 × 89 × 7927

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,562,240

Proper Divisor Sum 4,329,222

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #4233013 ← → #4233023

Radix Representation

Decimal	4233018
Binary	10000001001011100111010 (23 bits)
Octal	0o20113472
Hexadecimal	0x40973A

Divisor Catalog (16)

1 2 3 6 89 178 267 534 7,927 15,854 23,781 47,562 705,503 1,411,006 2,116,509 4,233,018

Collatz Trajectory (273 steps to reach 1)

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

4,233,018 2,116,509 6,349,528 3,174,764 1,587,382 793,691 2,381,074 1,190,537 3,571,612 1,785,806 892,903 2,678,710 1,339,355 4,018,066 2,009,033 6,027,100 3,013,550 1,506,775 4,520,326 2,260,163 6,780,490 3,390,245 10,170,736 5,085,368 2,542,684 1,271,342 635,671 1,907,014 953,507 2,860,522 1,430,261 4,290,784 2,145,392 1,072,696 536,348 268,174 134,087 402,262 201,131 603,394 301,697 905,092 452,546 226,273 678,820 339,410 169,705 509,116 254,558 127,279 381,838 190,919 572,758 286,379 859,138 429,569 1,288,708 644,354 322,177 966,532

← Previous Integer #4,233,017 Browse Full Index Next Integer #4,233,019 →