5,490,758

2 × 7 × 13 × 30169

5,490,758 factors as 2 × 7 × 13 × 30169. Its 16 positive divisors give a proper-divisor sum of 4,646,362, so this integer is deficient. The Collatz stopping time is 64 steps.

Prime Factor Structure

Factorization String 2 × 7 × 13 × 30169

Distinct Prime Factors 4

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,137,120

Proper Divisor Sum 4,646,362

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #5490743 ← → #5490769

Radix Representation

Decimal	5490758
Binary	10100111100100001000110 (23 bits)
Octal	0o24744106
Hexadecimal	0x53C846

Divisor Catalog (16)

1 2 7 13 14 26 91 182 30,169 60,338 211,183 392,197 422,366 784,394 2,745,379 5,490,758

Collatz Trajectory (64 steps to reach 1)

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

5,490,758 2,745,379 8,236,138 4,118,069 12,354,208 6,177,104 3,088,552 1,544,276 772,138 386,069 1,158,208 579,104 289,552 144,776 72,388 36,194 18,097 54,292 27,146 13,573 40,720 20,360 10,180 5,090 2,545 7,636 3,818 1,909 5,728 2,864 1,432 716 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

← Previous Integer #5,490,757 Browse Full Index Next Integer #5,490,759 →