7,898,436

2² × 3² × 7 × 13 × 2411

7,898,436 factors as 2^2 × 3^2 × 7 × 13 × 2411. Its 72 positive divisors give a proper-divisor sum of 16,684,668, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 7 × 13 × 2411

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 24,583,104

Proper Divisor Sum 16,684,668

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #7898417 ← → #7898447

Radix Representation

Decimal	7898436
Binary	11110001000010101000100 (23 bits)
Octal	0o36102504
Hexadecimal	0x788544

Divisor Catalog (60 of 72)

1 2 3 4 6 7 9 12 13 14 18 21 26 28 36 39 42 52 63 78 84 91 117 126 156 182 234 252 273 364 468 546 819 1,092 1,638 2,411 3,276 4,822 7,233 9,644 14,466 16,877 21,699 28,932 31,343 33,754 43,398 50,631 62,686 67,508 86,796 94,029 101,262 125,372 151,893 188,058 202,524 219,401 282,087 303,786

Collatz Trajectory (129 steps to reach 1)

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

7,898,436 3,949,218 1,974,609 5,923,828 2,961,914 1,480,957 4,442,872 2,221,436 1,110,718 555,359 1,666,078 833,039 2,499,118 1,249,559 3,748,678 1,874,339 5,623,018 2,811,509 8,434,528 4,217,264 2,108,632 1,054,316 527,158 263,579 790,738 395,369 1,186,108 593,054 296,527 889,582 444,791 1,334,374 667,187 2,001,562 1,000,781 3,002,344 1,501,172 750,586 375,293 1,125,880 562,940 281,470 140,735 422,206 211,103 633,310 316,655 949,966 474,983 1,424,950 712,475 2,137,426 1,068,713 3,206,140 1,603,070 801,535 2,404,606 1,202,303 3,606,910 1,803,455

← Previous Integer #7,898,435 Browse Full Index Next Integer #7,898,437 →