69,615,910

2 × 5 × 7 × 13 × 113 × 677

69,615,910 factors as 2 × 5 × 7 × 13 × 113 × 677. Its 64 positive divisors give a proper-divisor sum of 86,204,762, so this integer is abundant. The Collatz stopping time is 277 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 13 × 113 × 677

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 155,820,672

Proper Divisor Sum 86,204,762

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #69615899 ← → #69615911

Radix Representation

Decimal	69615910
Binary	100001001100100000100100110 (27 bits)
Octal	0o411440446
Hexadecimal	0x4264126

Divisor Catalog (60 of 64)

1 2 5 7 10 13 14 26 35 65 70 91 113 130 182 226 455 565 677 791 910 1,130 1,354 1,469 1,582 2,938 3,385 3,955 4,739 6,770 7,345 7,910 8,801 9,478 10,283 14,690 17,602 20,566 23,695 44,005 47,390 51,415 61,607 76,501 88,010 102,830 123,214 153,002 308,035 382,505 535,507 616,070 765,010 994,513 1,071,014 1,989,026 2,677,535 4,972,565 5,355,070 6,961,591

Collatz Trajectory (277 steps to reach 1)

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

69,615,910 34,807,955 104,423,866 52,211,933 156,635,800 78,317,900 39,158,950 19,579,475 58,738,426 29,369,213 88,107,640 44,053,820 22,026,910 11,013,455 33,040,366 16,520,183 49,560,550 24,780,275 74,340,826 37,170,413 111,511,240 55,755,620 27,877,810 13,938,905 41,816,716 20,908,358 10,454,179 31,362,538 15,681,269 47,043,808 23,521,904 11,760,952 5,880,476 2,940,238 1,470,119 4,410,358 2,205,179 6,615,538 3,307,769 9,923,308 4,961,654 2,480,827 7,442,482 3,721,241 11,163,724 5,581,862 2,790,931 8,372,794 4,186,397 12,559,192 6,279,596 3,139,798 1,569,899 4,709,698 2,354,849 7,064,548 3,532,274 1,766,137 5,298,412 2,649,206

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #69,615,909 Browse Full Index Next Integer #69,615,911 →