4,373,142

2 × 3 × 29 × 41 × 613

4,373,142 factors as 2 × 3 × 29 × 41 × 613. Its 32 positive divisors give a proper-divisor sum of 4,910,538, so this integer is abundant. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2 × 3 × 29 × 41 × 613

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,283,680

Proper Divisor Sum 4,910,538

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4373137 ← → #4373147

Radix Representation

Decimal	4373142
Binary	10000101011101010010110 (23 bits)
Octal	0o20535226
Hexadecimal	0x42BA96

Divisor Catalog (32)

1 2 3 6 29 41 58 82 87 123 174 246 613 1,189 1,226 1,839 2,378 3,567 3,678 7,134 17,777 25,133 35,554 50,266 53,331 75,399 106,662 150,798 728,857 1,457,714 2,186,571 4,373,142

Collatz Trajectory (87 steps to reach 1)

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

4,373,142 2,186,571 6,559,714 3,279,857 9,839,572 4,919,786 2,459,893 7,379,680 3,689,840 1,844,920 922,460 461,230 230,615 691,846 345,923 1,037,770 518,885 1,556,656 778,328 389,164 194,582 97,291 291,874 145,937 437,812 218,906 109,453 328,360 164,180 82,090 41,045 123,136 61,568 30,784 15,392 7,696 3,848 1,924 962 481 1,444 722 361 1,084 542 271 814 407 1,222 611 1,834 917 2,752 1,376 688 344 172 86 43 130

← Previous Integer #4,373,141 Browse Full Index Next Integer #4,373,143 →