69,201,054

2 × 3⁷ × 13 × 1217

69,201,054 factors as 2 × 3^7 × 13 × 1217. Its 64 positive divisors give a proper-divisor sum of 98,590,626, so this integer is abundant. The Collatz stopping time is 246 steps.

Prime Factor Structure

Factorization String 2 × 3^7 × 13 × 1217

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 167,791,680

Proper Divisor Sum 98,590,626

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #69201053 ← → #69201091

Radix Representation

Decimal	69201054
Binary	100000111111110110010011110 (27 bits)
Octal	0o407766236
Hexadecimal	0x41FEC9E

Divisor Catalog (60 of 64)

1 2 3 6 9 13 18 26 27 39 54 78 81 117 162 234 243 351 486 702 729 1,053 1,217 1,458 2,106 2,187 2,434 3,159 3,651 4,374 6,318 7,302 9,477 10,953 15,821 18,954 21,906 28,431 31,642 32,859 47,463 56,862 65,718 94,926 98,577 142,389 197,154 284,778 295,731 427,167 591,462 854,334 887,193 1,281,501 1,774,386 2,563,002 2,661,579 3,844,503 5,323,158 7,689,006

Collatz Trajectory (246 steps to reach 1)

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

69,201,054 34,600,527 103,801,582 51,900,791 155,702,374 77,851,187 233,553,562 116,776,781 350,330,344 175,165,172 87,582,586 43,791,293 131,373,880 65,686,940 32,843,470 16,421,735 49,265,206 24,632,603 73,897,810 36,948,905 110,846,716 55,423,358 27,711,679 83,135,038 41,567,519 124,702,558 62,351,279 187,053,838 93,526,919 280,580,758 140,290,379 420,871,138 210,435,569 631,306,708 315,653,354 157,826,677 473,480,032 236,740,016 118,370,008 59,185,004 29,592,502 14,796,251 44,388,754 22,194,377 66,583,132 33,291,566 16,645,783 49,937,350 24,968,675 74,906,026 37,453,013 112,359,040 56,179,520 28,089,760 14,044,880 7,022,440 3,511,220 1,755,610 877,805 2,633,416

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #69,201,053 Browse Full Index Next Integer #69,201,055 →