2,797,953

3 × 932651

2,797,953 factors as 3 × 932651. Its 4 positive divisors give a proper-divisor sum of 932,655, so this integer is deficient. The Collatz stopping time is 63 steps.

Prime Factor Structure

Factorization String 3 × 932651

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 3,730,608

Proper Divisor Sum 932,655

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #2797939 ← → #2797961

Radix Representation

Decimal	2797953
Binary	1010101011000110000001 (22 bits)
Octal	0o12530601
Hexadecimal	0x2AB181

Divisor Catalog (4)

1 3 932,651 2,797,953

Collatz Trajectory (63 steps to reach 1)

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

2,797,953 8,393,860 4,196,930 2,098,465 6,295,396 3,147,698 1,573,849 4,721,548 2,360,774 1,180,387 3,541,162 1,770,581 5,311,744 2,655,872 1,327,936 663,968 331,984 165,992 82,996 41,498 20,749 62,248 31,124 15,562 7,781 23,344 11,672 5,836 2,918 1,459 4,378 2,189 6,568 3,284 1,642 821 2,464 1,232 616 308 154 77 232 116 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16

← Previous Integer #2,797,952 Browse Full Index Next Integer #2,797,954 →