2,115,968

2⁷ × 61 × 271

2,115,968 factors as 2^7 × 61 × 271. Its 32 positive divisors give a proper-divisor sum of 2,184,352, so this integer is abundant. The Collatz stopping time is 148 steps.

Prime Factor Structure

Factorization String 2^7 × 61 × 271

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 4,300,320

Proper Divisor Sum 2,184,352

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #2115961 ← → #2115979

Radix Representation

Decimal	2115968
Binary	1000000100100110000000 (22 bits)
Octal	0o10044600
Hexadecimal	0x204980

Divisor Catalog (32)

1 2 4 8 16 32 61 64 122 128 244 271 488 542 976 1,084 1,952 2,168 3,904 4,336 7,808 8,672 16,531 17,344 33,062 34,688 66,124 132,248 264,496 528,992 1,057,984 2,115,968

Collatz Trajectory (148 steps to reach 1)

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

2,115,968 1,057,984 528,992 264,496 132,248 66,124 33,062 16,531 49,594 24,797 74,392 37,196 18,598 9,299 27,898 13,949 41,848 20,924 10,462 5,231 15,694 7,847 23,542 11,771 35,314 17,657 52,972 26,486 13,243 39,730 19,865 59,596 29,798 14,899 44,698 22,349 67,048 33,524 16,762 8,381 25,144 12,572 6,286 3,143 9,430 4,715 14,146 7,073 21,220 10,610 5,305 15,916 7,958 3,979 11,938 5,969 17,908 8,954 4,477 13,432

← Previous Integer #2,115,967 Browse Full Index Next Integer #2,115,969 →