5,640,468

2² × 3 × 470039

5,640,468 factors as 2^2 × 3 × 470039. Its 12 positive divisors give a proper-divisor sum of 7,520,652, so this integer is abundant. The Collatz stopping time is 77 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 470039

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,161,120

Proper Divisor Sum 7,520,652

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5640463 ← → #5640527

Radix Representation

Decimal	5640468
Binary	10101100001000100010100 (23 bits)
Octal	0o25410424
Hexadecimal	0x561114

Divisor Catalog (12)

1 2 3 4 6 12 470,039 940,078 1,410,117 1,880,156 2,820,234 5,640,468

Collatz Trajectory (77 steps to reach 1)

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

5,640,468 2,820,234 1,410,117 4,230,352 2,115,176 1,057,588 528,794 264,397 793,192 396,596 198,298 99,149 297,448 148,724 74,362 37,181 111,544 55,772 27,886 13,943 41,830 20,915 62,746 31,373 94,120 47,060 23,530 11,765 35,296 17,648 8,824 4,412 2,206 1,103 3,310 1,655 4,966 2,483 7,450 3,725 11,176 5,588 2,794 1,397 4,192 2,096 1,048 524 262 131 394 197 592 296 148 74 37 112 56 28

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,640,467 Browse Full Index Next Integer #5,640,469 →