3,538,902

2 × 3 × 19 × 37 × 839

3,538,902 factors as 2 × 3 × 19 × 37 × 839. Its 32 positive divisors give a proper-divisor sum of 4,121,898, so this integer is abundant. The Collatz stopping time is 265 steps.

Prime Factor Structure

Factorization String 2 × 3 × 19 × 37 × 839

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 7,660,800

Proper Divisor Sum 4,121,898

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3538901 ← → #3538919

Radix Representation

Decimal	3538902
Binary	1101011111111111010110 (22 bits)
Octal	0o15377726
Hexadecimal	0x35FFD6

Divisor Catalog (32)

1 2 3 6 19 37 38 57 74 111 114 222 703 839 1,406 1,678 2,109 2,517 4,218 5,034 15,941 31,043 31,882 47,823 62,086 93,129 95,646 186,258 589,817 1,179,634 1,769,451 3,538,902

Collatz Trajectory (265 steps to reach 1)

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

3,538,902 1,769,451 5,308,354 2,654,177 7,962,532 3,981,266 1,990,633 5,971,900 2,985,950 1,492,975 4,478,926 2,239,463 6,718,390 3,359,195 10,077,586 5,038,793 15,116,380 7,558,190 3,779,095 11,337,286 5,668,643 17,005,930 8,502,965 25,508,896 12,754,448 6,377,224 3,188,612 1,594,306 797,153 2,391,460 1,195,730 597,865 1,793,596 896,798 448,399 1,345,198 672,599 2,017,798 1,008,899 3,026,698 1,513,349 4,540,048 2,270,024 1,135,012 567,506 283,753 851,260 425,630 212,815 638,446 319,223 957,670 478,835 1,436,506 718,253 2,154,760 1,077,380 538,690 269,345 808,036

← Previous Integer #3,538,901 Browse Full Index Next Integer #3,538,903 →