65,614,530

2 × 3 × 5 × 29 × 53 × 1423

65,614,530 factors as 2 × 3 × 5 × 29 × 53 × 1423. Its 64 positive divisors give a proper-divisor sum of 100,480,830, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 29 × 53 × 1423

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 166,095,360

Proper Divisor Sum 100,480,830

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #65614529 ← → #65614547

Radix Representation

Decimal	65614530
Binary	11111010010011001011000010 (26 bits)
Octal	0o372231302
Hexadecimal	0x3E932C2

Divisor Catalog (60 of 64)

1 2 3 5 6 10 15 29 30 53 58 87 106 145 159 174 265 290 318 435 530 795 870 1,423 1,537 1,590 2,846 3,074 4,269 4,611 7,115 7,685 8,538 9,222 14,230 15,370 21,345 23,055 41,267 42,690 46,110 75,419 82,534 123,801 150,838 206,335 226,257 247,602 377,095 412,670 452,514 619,005 754,190 1,131,285 1,238,010 2,187,151 2,262,570 4,374,302 6,561,453 10,935,755

Collatz Trajectory (194 steps to reach 1)

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

65,614,530 32,807,265 98,421,796 49,210,898 24,605,449 73,816,348 36,908,174 18,454,087 55,362,262 27,681,131 83,043,394 41,521,697 124,565,092 62,282,546 31,141,273 93,423,820 46,711,910 23,355,955 70,067,866 35,033,933 105,101,800 52,550,900 26,275,450 13,137,725 39,413,176 19,706,588 9,853,294 4,926,647 14,779,942 7,389,971 22,169,914 11,084,957 33,254,872 16,627,436 8,313,718 4,156,859 12,470,578 6,235,289 18,705,868 9,352,934 4,676,467 14,029,402 7,014,701 21,044,104 10,522,052 5,261,026 2,630,513 7,891,540 3,945,770 1,972,885 5,918,656 2,959,328 1,479,664 739,832 369,916 184,958 92,479 277,438 138,719 416,158

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #65,614,529 Browse Full Index Next Integer #65,614,531 →