4,640,952

2³ × 3 × 193373

4,640,952 factors as 2^3 × 3 × 193373. Its 16 positive divisors give a proper-divisor sum of 6,961,488, so this integer is abundant. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 193373

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 11,602,440

Proper Divisor Sum 6,961,488

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4640929 ← → #4640953

Radix Representation

Decimal	4640952
Binary	10001101101000010111000 (23 bits)
Octal	0o21550270
Hexadecimal	0x46D0B8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 193,373 386,746 580,119 773,492 1,160,238 1,546,984 2,320,476 4,640,952

Collatz Trajectory (193 steps to reach 1)

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

4,640,952 2,320,476 1,160,238 580,119 1,740,358 870,179 2,610,538 1,305,269 3,915,808 1,957,904 978,952 489,476 244,738 122,369 367,108 183,554 91,777 275,332 137,666 68,833 206,500 103,250 51,625 154,876 77,438 38,719 116,158 58,079 174,238 87,119 261,358 130,679 392,038 196,019 588,058 294,029 882,088 441,044 220,522 110,261 330,784 165,392 82,696 41,348 20,674 10,337 31,012 15,506 7,753 23,260 11,630 5,815 17,446 8,723 26,170 13,085 39,256 19,628 9,814 4,907

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,640,951 Browse Full Index Next Integer #4,640,953 →