3,032,697

3 × 1010899

3,032,697 factors as 3 × 1010899. Its 4 positive divisors give a proper-divisor sum of 1,010,903, so this integer is deficient. The Collatz stopping time is 107 steps.

Prime Factor Structure

Factorization String 3 × 1010899

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 4,043,600

Proper Divisor Sum 1,010,903

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3032693 ← → #3032717

Radix Representation

Decimal	3032697
Binary	1011100100011001111001 (22 bits)
Octal	0o13443171
Hexadecimal	0x2E4679

Divisor Catalog (4)

1 3 1,010,899 3,032,697

Collatz Trajectory (107 steps to reach 1)

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

3,032,697 9,098,092 4,549,046 2,274,523 6,823,570 3,411,785 10,235,356 5,117,678 2,558,839 7,676,518 3,838,259 11,514,778 5,757,389 17,272,168 8,636,084 4,318,042 2,159,021 6,477,064 3,238,532 1,619,266 809,633 2,428,900 1,214,450 607,225 1,821,676 910,838 455,419 1,366,258 683,129 2,049,388 1,024,694 512,347 1,537,042 768,521 2,305,564 1,152,782 576,391 1,729,174 864,587 2,593,762 1,296,881 3,890,644 1,945,322 972,661 2,917,984 1,458,992 729,496 364,748 182,374 91,187 273,562 136,781 410,344 205,172 102,586 51,293 153,880 76,940 38,470 19,235

← Previous Integer #3,032,696 Browse Full Index Next Integer #3,032,698 →