2,070,567

3² × 230063

2,070,567 factors as 3^2 × 230063. Its 6 positive divisors give a proper-divisor sum of 920,265, so this integer is deficient. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 3^2 × 230063

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 6

Divisor Sum (σ) 2,990,832

Proper Divisor Sum 920,265

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2070559 ← → #2070569

Radix Representation

Decimal	2070567
Binary	111111001100000100111 (21 bits)
Octal	0o7714047
Hexadecimal	0x1F9827

Divisor Catalog (6)

1 3 9 230,063 690,189 2,070,567

Collatz Trajectory (135 steps to reach 1)

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

2,070,567 6,211,702 3,105,851 9,317,554 4,658,777 13,976,332 6,988,166 3,494,083 10,482,250 5,241,125 15,723,376 7,861,688 3,930,844 1,965,422 982,711 2,948,134 1,474,067 4,422,202 2,211,101 6,633,304 3,316,652 1,658,326 829,163 2,487,490 1,243,745 3,731,236 1,865,618 932,809 2,798,428 1,399,214 699,607 2,098,822 1,049,411 3,148,234 1,574,117 4,722,352 2,361,176 1,180,588 590,294 295,147 885,442 442,721 1,328,164 664,082 332,041 996,124 498,062 249,031 747,094 373,547 1,120,642 560,321 1,680,964 840,482 420,241 1,260,724 630,362 315,181 945,544 472,772

← Previous Integer #2,070,566 Browse Full Index Next Integer #2,070,568 →