51,169,470

2 × 3 × 5 × 11 × 19 × 8161

51,169,470 factors as 2 × 3 × 5 × 11 × 19 × 8161. Its 64 positive divisors give a proper-divisor sum of 89,869,890, so this integer is abundant. The Collatz stopping time is 212 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 11 × 19 × 8161

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 141,039,360

Proper Divisor Sum 89,869,890

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #51169463 ← → #51169523

Radix Representation

Decimal	51169470
Binary	11000011001100100010111110 (26 bits)
Octal	0o303144276
Hexadecimal	0x30CC8BE

Divisor Catalog (60 of 64)

1 2 3 5 6 10 11 15 19 22 30 33 38 55 57 66 95 110 114 165 190 209 285 330 418 570 627 1,045 1,254 2,090 3,135 6,270 8,161 16,322 24,483 40,805 48,966 81,610 89,771 122,415 155,059 179,542 244,830 269,313 310,118 448,855 465,177 538,626 775,295 897,710 930,354 1,346,565 1,550,590 1,705,649 2,325,885 2,693,130 3,411,298 4,651,770 5,116,947 8,528,245

Collatz Trajectory (212 steps to reach 1)

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

51,169,470 25,584,735 76,754,206 38,377,103 115,131,310 57,565,655 172,696,966 86,348,483 259,045,450 129,522,725 388,568,176 194,284,088 97,142,044 48,571,022 24,285,511 72,856,534 36,428,267 109,284,802 54,642,401 163,927,204 81,963,602 40,981,801 122,945,404 61,472,702 30,736,351 92,209,054 46,104,527 138,313,582 69,156,791 207,470,374 103,735,187 311,205,562 155,602,781 466,808,344 233,404,172 116,702,086 58,351,043 175,053,130 87,526,565 262,579,696 131,289,848 65,644,924 32,822,462 16,411,231 49,233,694 24,616,847 73,850,542 36,925,271 110,775,814 55,387,907 166,163,722 83,081,861 249,245,584 124,622,792 62,311,396 31,155,698 15,577,849 46,733,548 23,366,774 11,683,387

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #51,169,469 Browse Full Index Next Integer #51,169,471 →