2,500,452

2² × 3² × 69457

2,500,452 factors as 2^2 × 3^2 × 69457. Its 18 positive divisors give a proper-divisor sum of 3,820,226, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 69457

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 6,320,678

Proper Divisor Sum 3,820,226

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #2500441 ← → #2500523

Radix Representation

Decimal	2500452
Binary	1001100010011101100100 (22 bits)
Octal	0o11423544
Hexadecimal	0x262764

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 69,457 138,914 208,371 277,828 416,742 625,113 833,484 1,250,226 2,500,452

Collatz Trajectory (81 steps to reach 1)

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

2,500,452 1,250,226 625,113 1,875,340 937,670 468,835 1,406,506 703,253 2,109,760 1,054,880 527,440 263,720 131,860 65,930 32,965 98,896 49,448 24,724 12,362 6,181 18,544 9,272 4,636 2,318 1,159 3,478 1,739 5,218 2,609 7,828 3,914 1,957 5,872 2,936 1,468 734 367 1,102 551 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192 2,096 1,048 524 262 131 394 197 592 296 148 74

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,500,451 Browse Full Index Next Integer #2,500,453 →