2,256,368

2⁴ × 141023

2,256,368 factors as 2^4 × 141023. Its 10 positive divisors give a proper-divisor sum of 2,115,376, so this integer is deficient. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2^4 × 141023

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 10

Divisor Sum (σ) 4,371,744

Proper Divisor Sum 2,115,376

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #2256367 ← → #2256377

Radix Representation

Decimal	2256368
Binary	1000100110110111110000 (22 bits)
Octal	0o10466760
Hexadecimal	0x226DF0

Divisor Catalog (10)

1 2 4 8 16 141,023 282,046 564,092 1,128,184 2,256,368

Collatz Trajectory (86 steps to reach 1)

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

2,256,368 1,128,184 564,092 282,046 141,023 423,070 211,535 634,606 317,303 951,910 475,955 1,427,866 713,933 2,141,800 1,070,900 535,450 267,725 803,176 401,588 200,794 100,397 301,192 150,596 75,298 37,649 112,948 56,474 28,237 84,712 42,356 21,178 10,589 31,768 15,884 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 944 472 236 118 59 178 89 268 134 67

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,256,367 Browse Full Index Next Integer #2,256,369 →