2,256,140

2² × 5 × 112807

2,256,140 factors as 2^2 × 5 × 112807. Its 12 positive divisors give a proper-divisor sum of 2,481,796, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 112807

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,737,936

Proper Divisor Sum 2,481,796

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #2256131 ← → #2256169

Radix Representation

Decimal	2256140
Binary	1000100110110100001100 (22 bits)
Octal	0o10466414
Hexadecimal	0x226D0C

Divisor Catalog (12)

1 2 4 5 10 20 112,807 225,614 451,228 564,035 1,128,070 2,256,140

Collatz Trajectory (86 steps to reach 1)

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

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 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,139 Browse Full Index Next Integer #2,256,141 →