8,952,520

2³ × 5 × 23 × 37 × 263

8,952,520 factors as 2^3 × 5 × 23 × 37 × 263. Its 64 positive divisors give a proper-divisor sum of 12,716,600, so this integer is abundant. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 23 × 37 × 263

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 21,669,120

Proper Divisor Sum 12,716,600

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #8952511 ← → #8952529

Radix Representation

Decimal	8952520
Binary	100010001001101011001000 (24 bits)
Octal	0o42115310
Hexadecimal	0x889AC8

Divisor Catalog (60 of 64)

1 2 4 5 8 10 20 23 37 40 46 74 92 115 148 184 185 230 263 296 370 460 526 740 851 920 1,052 1,315 1,480 1,702 2,104 2,630 3,404 4,255 5,260 6,049 6,808 8,510 9,731 10,520 12,098 17,020 19,462 24,196 30,245 34,040 38,924 48,392 48,655 60,490 77,848 97,310 120,980 194,620 223,813 241,960 389,240 447,626 895,252 1,119,065

Collatz Trajectory (181 steps to reach 1)

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

8,952,520 4,476,260 2,238,130 1,119,065 3,357,196 1,678,598 839,299 2,517,898 1,258,949 3,776,848 1,888,424 944,212 472,106 236,053 708,160 354,080 177,040 88,520 44,260 22,130 11,065 33,196 16,598 8,299 24,898 12,449 37,348 18,674 9,337 28,012 14,006 7,003 21,010 10,505 31,516 15,758 7,879 23,638 11,819 35,458 17,729 53,188 26,594 13,297 39,892 19,946 9,973 29,920 14,960 7,480 3,740 1,870 935 2,806 1,403 4,210 2,105 6,316 3,158 1,579

← Previous Integer #8,952,519 Browse Full Index Next Integer #8,952,521 →