4,735,338

2 × 3 × 53 × 14891

4,735,338 factors as 2 × 3 × 53 × 14891. Its 16 positive divisors give a proper-divisor sum of 4,914,678, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2 × 3 × 53 × 14891

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,650,016

Proper Divisor Sum 4,914,678

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4735331 ← → #4735349

Radix Representation

Decimal	4735338
Binary	10010000100000101101010 (23 bits)
Octal	0o22040552
Hexadecimal	0x48416A

Divisor Catalog (16)

1 2 3 6 53 106 159 318 14,891 29,782 44,673 89,346 789,223 1,578,446 2,367,669 4,735,338

Collatz Trajectory (162 steps to reach 1)

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

4,735,338 2,367,669 7,103,008 3,551,504 1,775,752 887,876 443,938 221,969 665,908 332,954 166,477 499,432 249,716 124,858 62,429 187,288 93,644 46,822 23,411 70,234 35,117 105,352 52,676 26,338 13,169 39,508 19,754 9,877 29,632 14,816 7,408 3,704 1,852 926 463 1,390 695 2,086 1,043 3,130 1,565 4,696 2,348 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142

← Previous Integer #4,735,337 Browse Full Index Next Integer #4,735,339 →