1,164,480

2⁶ × 3 × 5 × 1213

1,164,480 factors as 2^6 × 3 × 5 × 1213. Its 56 positive divisors give a proper-divisor sum of 2,535,792, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 5 × 1213

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 56

Divisor Sum (σ) 3,700,272

Proper Divisor Sum 2,535,792

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1164479 ← → #1164497

Radix Representation

Decimal	1164480
Binary	100011100010011000000 (21 bits)
Octal	0o4342300
Hexadecimal	0x11C4C0

Divisor Catalog (56)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 32 40 48 60 64 80 96 120 160 192 240 320 480 960 1,213 2,426 3,639 4,852 6,065 7,278 9,704 12,130 14,556 18,195 19,408 24,260 29,112 36,390 38,816 48,520 58,224 72,780 77,632 97,040 116,448 145,560 194,080 232,896 291,120 388,160 582,240 1,164,480

Collatz Trajectory (129 steps to reach 1)

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

1,164,480 582,240 291,120 145,560 72,780 36,390 18,195 54,586 27,293 81,880 40,940 20,470 10,235 30,706 15,353 46,060 23,030 11,515 34,546 17,273 51,820 25,910 12,955 38,866 19,433 58,300 29,150 14,575 43,726 21,863 65,590 32,795 98,386 49,193 147,580 73,790 36,895 110,686 55,343 166,030 83,015 249,046 124,523 373,570 186,785 560,356 280,178 140,089 420,268 210,134 105,067 315,202 157,601 472,804 236,402 118,201 354,604 177,302 88,651 265,954

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