10,696,548

2² × 3 × 891379

10,696,548 factors as 2^2 × 3 × 891379. Its 12 positive divisors give a proper-divisor sum of 14,262,092, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 891379

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 24,958,640

Proper Divisor Sum 14,262,092

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #10696547 ← → #10696571

Radix Representation

Decimal	10696548
Binary	101000110011011101100100 (24 bits)
Octal	0o50633544
Hexadecimal	0xA33764

Divisor Catalog (12)

1 2 3 4 6 12 891,379 1,782,758 2,674,137 3,565,516 5,348,274 10,696,548

Collatz Trajectory (70 steps to reach 1)

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

10,696,548 5,348,274 2,674,137 8,022,412 4,011,206 2,005,603 6,016,810 3,008,405 9,025,216 4,512,608 2,256,304 1,128,152 564,076 282,038 141,019 423,058 211,529 634,588 317,294 158,647 475,942 237,971 713,914 356,957 1,070,872 535,436 267,718 133,859 401,578 200,789 602,368 301,184 150,592 75,296 37,648 18,824 9,412 4,706 2,353 7,060 3,530 1,765 5,296 2,648 1,324 662 331 994 497 1,492 746 373 1,120 560 280 140 70 35 106 53

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #10,696,547 Browse Full Index Next Integer #10,696,549 →