215,325

3³ × 5² × 11 × 29

215,325 factors as 3^3 × 5^2 × 11 × 29. Its 48 positive divisors give a proper-divisor sum of 231,075, so this integer is abundant. The Collatz stopping time is 54 steps.

Prime Factor Structure

Factorization String 3^3 × 5^2 × 11 × 29

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 446,400

Proper Divisor Sum 231,075

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #215317 ← → #215329

Radix Representation

Decimal	215325
Binary	110100100100011101 (18 bits)
Octal	0o644435
Hexadecimal	0x3491D

Divisor Catalog (48)

1 3 5 9 11 15 25 27 29 33 45 55 75 87 99 135 145 165 225 261 275 297 319 435 495 675 725 783 825 957 1,305 1,485 1,595 2,175 2,475 2,871 3,915 4,785 6,525 7,425 7,975 8,613 14,355 19,575 23,925 43,065 71,775 215,325

Collatz Trajectory (54 steps to reach 1)

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

215,325 645,976 322,988 161,494 80,747 242,242 121,121 363,364 181,682 90,841 272,524 136,262 68,131 204,394 102,197 306,592 153,296 76,648 38,324 19,162 9,581 28,744 14,372 7,186 3,593 10,780 5,390 2,695 8,086 4,043 12,130 6,065 18,196 9,098 4,549 13,648 6,824 3,412 1,706 853 2,560 1,280 640 320 160 80 40 20 10 5 16 8 4 2 1

← Previous Integer #215,324 Browse Full Index Next Integer #215,326 →