3,066,538

2 × 293 × 5233

3,066,538 factors as 2 × 293 × 5233. Its 8 positive divisors give a proper-divisor sum of 1,549,850, so this integer is deficient. The Collatz stopping time is 58 steps.

Prime Factor Structure

Factorization String 2 × 293 × 5233

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,616,388

Proper Divisor Sum 1,549,850

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3066533 ← → #3066541

Radix Representation

Decimal	3066538
Binary	1011101100101010101010 (22 bits)
Octal	0o13545252
Hexadecimal	0x2ECAAA

Divisor Catalog (8)

1 2 293 586 5,233 10,466 1,533,269 3,066,538

Collatz Trajectory (58 steps to reach 1)

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

3,066,538 1,533,269 4,599,808 2,299,904 1,149,952 574,976 287,488 143,744 71,872 35,936 17,968 8,984 4,492 2,246 1,123 3,370 1,685 5,056 2,528 1,264 632 316 158 79 238 119 358 179 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #3,066,537 Browse Full Index Next Integer #3,066,539 →