4,153,530

2 × 3 × 5 × 138451

4,153,530 factors as 2 × 3 × 5 × 138451. Its 16 positive divisors give a proper-divisor sum of 5,815,014, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 138451

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,968,544

Proper Divisor Sum 5,815,014

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #4153529 ← → #4153543

Radix Representation

Decimal	4153530
Binary	1111110110000010111010 (22 bits)
Octal	0o17660272
Hexadecimal	0x3F60BA

Divisor Catalog (16)

1 2 3 5 6 10 15 30 138,451 276,902 415,353 692,255 830,706 1,384,510 2,076,765 4,153,530

Collatz Trajectory (167 steps to reach 1)

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

4,153,530 2,076,765 6,230,296 3,115,148 1,557,574 778,787 2,336,362 1,168,181 3,504,544 1,752,272 876,136 438,068 219,034 109,517 328,552 164,276 82,138 41,069 123,208 61,604 30,802 15,401 46,204 23,102 11,551 34,654 17,327 51,982 25,991 77,974 38,987 116,962 58,481 175,444 87,722 43,861 131,584 65,792 32,896 16,448 8,224 4,112 2,056 1,028 514 257 772 386 193 580 290 145 436 218 109 328 164 82 41 124

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,153,529 Browse Full Index Next Integer #4,153,531 →