4,101,162

2 × 3 × 13 × 52579

4,101,162 factors as 2 × 3 × 13 × 52579. Its 16 positive divisors give a proper-divisor sum of 4,732,278, so this integer is abundant. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 52579

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,833,440

Proper Divisor Sum 4,732,278

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #4101133 ← → #4101179

Radix Representation

Decimal	4101162
Binary	1111101001010000101010 (22 bits)
Octal	0o17512052
Hexadecimal	0x3E942A

Divisor Catalog (16)

1 2 3 6 13 26 39 78 52,579 105,158 157,737 315,474 683,527 1,367,054 2,050,581 4,101,162

Collatz Trajectory (123 steps to reach 1)

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

4,101,162 2,050,581 6,151,744 3,075,872 1,537,936 768,968 384,484 192,242 96,121 288,364 144,182 72,091 216,274 108,137 324,412 162,206 81,103 243,310 121,655 364,966 182,483 547,450 273,725 821,176 410,588 205,294 102,647 307,942 153,971 461,914 230,957 692,872 346,436 173,218 86,609 259,828 129,914 64,957 194,872 97,436 48,718 24,359 73,078 36,539 109,618 54,809 164,428 82,214 41,107 123,322 61,661 184,984 92,492 46,246 23,123 69,370 34,685 104,056 52,028 26,014

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,101,161 Browse Full Index Next Integer #4,101,163 →