1,245,480

2³ × 3 × 5 × 97 × 107

1,245,480 factors as 2^3 × 3 × 5 × 97 × 107. Its 64 positive divisors give a proper-divisor sum of 2,564,760, so this integer is abundant. The Collatz stopping time is 111 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 97 × 107

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 3,810,240

Proper Divisor Sum 2,564,760

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1245479 ← → #1245509

Radix Representation

Decimal	1245480
Binary	100110000000100101000 (21 bits)
Octal	0o4600450
Hexadecimal	0x130128

Divisor Catalog (60 of 64)

1 2 3 4 5 6 8 10 12 15 20 24 30 40 60 97 107 120 194 214 291 321 388 428 485 535 582 642 776 856 970 1,070 1,164 1,284 1,455 1,605 1,940 2,140 2,328 2,568 2,910 3,210 3,880 4,280 5,820 6,420 10,379 11,640 12,840 20,758 31,137 41,516 51,895 62,274 83,032 103,790 124,548 155,685 207,580 249,096

Collatz Trajectory (111 steps to reach 1)

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

1,245,480 622,740 311,370 155,685 467,056 233,528 116,764 58,382 29,191 87,574 43,787 131,362 65,681 197,044 98,522 49,261 147,784 73,892 36,946 18,473 55,420 27,710 13,855 41,566 20,783 62,350 31,175 93,526 46,763 140,290 70,145 210,436 105,218 52,609 157,828 78,914 39,457 118,372 59,186 29,593 88,780 44,390 22,195 66,586 33,293 99,880 49,940 24,970 12,485 37,456 18,728 9,364 4,682 2,341 7,024 3,512 1,756 878 439 1,318

← Previous Integer #1,245,479 Browse Full Index Next Integer #1,245,481 →