15,212,130

2 × 3 × 5 × 507071

15,212,130 factors as 2 × 3 × 5 × 507071. Its 16 positive divisors give a proper-divisor sum of 21,297,054, so this integer is abundant. The Collatz stopping time is 143 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 507071

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 36,509,184

Proper Divisor Sum 21,297,054

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #15212129 ← → #15212137

Radix Representation

Decimal	15212130
Binary	111010000001111001100010 (24 bits)
Octal	0o72017142
Hexadecimal	0xE81E62

Divisor Catalog (16)

1 2 3 5 6 10 15 30 507,071 1,014,142 1,521,213 2,535,355 3,042,426 5,070,710 7,606,065 15,212,130

Collatz Trajectory (143 steps to reach 1)

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

15,212,130 7,606,065 22,818,196 11,409,098 5,704,549 17,113,648 8,556,824 4,278,412 2,139,206 1,069,603 3,208,810 1,604,405 4,813,216 2,406,608 1,203,304 601,652 300,826 150,413 451,240 225,620 112,810 56,405 169,216 84,608 42,304 21,152 10,576 5,288 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #15,212,129 Browse Full Index Next Integer #15,212,131 →