10,695,768

2³ × 3 × 445657

10,695,768 factors as 2^3 × 3 × 445657. Its 16 positive divisors give a proper-divisor sum of 16,043,712, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 445657

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 26,739,480

Proper Divisor Sum 16,043,712

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #10695761 ← → #10695781

Radix Representation

Decimal	10695768
Binary	101000110011010001011000 (24 bits)
Octal	0o50632130
Hexadecimal	0xA33458

Divisor Catalog (16)

1 2 3 4 6 8 12 24 445,657 891,314 1,336,971 1,782,628 2,673,942 3,565,256 5,347,884 10,695,768

Collatz Trajectory (96 steps to reach 1)

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

10,695,768 5,347,884 2,673,942 1,336,971 4,010,914 2,005,457 6,016,372 3,008,186 1,504,093 4,512,280 2,256,140 1,128,070 564,035 1,692,106 846,053 2,538,160 1,269,080 634,540 317,270 158,635 475,906 237,953 713,860 356,930 178,465 535,396 267,698 133,849 401,548 200,774 100,387 301,162 150,581 451,744 225,872 112,936 56,468 28,234 14,117 42,352 21,176 10,588 5,294 2,647 7,942 3,971 11,914 5,957 17,872 8,936 4,468 2,234 1,117 3,352 1,676 838 419 1,258 629 1,888

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #10,695,767 Browse Full Index Next Integer #10,695,769 →