3,268,101

3 × 107 × 10181

3,268,101 factors as 3 × 107 × 10181. Its 8 positive divisors give a proper-divisor sum of 1,130,523, so this integer is deficient. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 3 × 107 × 10181

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,398,624

Proper Divisor Sum 1,130,523

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3268079 ← → #3268103

Radix Representation

Decimal	3268101
Binary	1100011101111000000101 (22 bits)
Octal	0o14357005
Hexadecimal	0x31DE05

Divisor Catalog (8)

1 3 107 321 10,181 30,543 1,089,367 3,268,101

Collatz Trajectory (89 steps to reach 1)

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

3,268,101 9,804,304 4,902,152 2,451,076 1,225,538 612,769 1,838,308 919,154 459,577 1,378,732 689,366 344,683 1,034,050 517,025 1,551,076 775,538 387,769 1,163,308 581,654 290,827 872,482 436,241 1,308,724 654,362 327,181 981,544 490,772 245,386 122,693 368,080 184,040 92,020 46,010 23,005 69,016 34,508 17,254 8,627 25,882 12,941 38,824 19,412 9,706 4,853 14,560 7,280 3,640 1,820 910 455 1,366 683 2,050 1,025 3,076 1,538 769 2,308 1,154 577

← Previous Integer #3,268,100 Browse Full Index Next Integer #3,268,102 →