3,135,264

2⁵ × 3 × 11 × 2969

3,135,264 factors as 2^5 × 3 × 11 × 2969. Its 48 positive divisors give a proper-divisor sum of 5,846,016, so this integer is abundant. The Collatz stopping time is 195 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 11 × 2969

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 8,981,280

Proper Divisor Sum 5,846,016

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3135227 ← → #3135283

Radix Representation

Decimal	3135264
Binary	1011111101011100100000 (22 bits)
Octal	0o13753440
Hexadecimal	0x2FD720

Divisor Catalog (48)

1 2 3 4 6 8 11 12 16 22 24 32 33 44 48 66 88 96 132 176 264 352 528 1,056 2,969 5,938 8,907 11,876 17,814 23,752 32,659 35,628 47,504 65,318 71,256 95,008 97,977 130,636 142,512 195,954 261,272 285,024 391,908 522,544 783,816 1,045,088 1,567,632 3,135,264

Collatz Trajectory (195 steps to reach 1)

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

3,135,264 1,567,632 783,816 391,908 195,954 97,977 293,932 146,966 73,483 220,450 110,225 330,676 165,338 82,669 248,008 124,004 62,002 31,001 93,004 46,502 23,251 69,754 34,877 104,632 52,316 26,158 13,079 39,238 19,619 58,858 29,429 88,288 44,144 22,072 11,036 5,518 2,759 8,278 4,139 12,418 6,209 18,628 9,314 4,657 13,972 6,986 3,493 10,480 5,240 2,620 1,310 655 1,966 983 2,950 1,475 4,426 2,213 6,640 3,320

← Previous Integer #3,135,263 Browse Full Index Next Integer #3,135,265 →