4,701,084

2² × 3 × 391757

4,701,084 factors as 2^2 × 3 × 391757. Its 12 positive divisors give a proper-divisor sum of 6,268,140, so this integer is abundant. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 391757

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,969,224

Proper Divisor Sum 6,268,140

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4701071 ← → #4701107

Radix Representation

Decimal	4701084
Binary	10001111011101110011100 (23 bits)
Octal	0o21735634
Hexadecimal	0x47BB9C

Divisor Catalog (12)

1 2 3 4 6 12 391,757 783,514 1,175,271 1,567,028 2,350,542 4,701,084

Collatz Trajectory (193 steps to reach 1)

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

4,701,084 2,350,542 1,175,271 3,525,814 1,762,907 5,288,722 2,644,361 7,933,084 3,966,542 1,983,271 5,949,814 2,974,907 8,924,722 4,462,361 13,387,084 6,693,542 3,346,771 10,040,314 5,020,157 15,060,472 7,530,236 3,765,118 1,882,559 5,647,678 2,823,839 8,471,518 4,235,759 12,707,278 6,353,639 19,060,918 9,530,459 28,591,378 14,295,689 42,887,068 21,443,534 10,721,767 32,165,302 16,082,651 48,247,954 24,123,977 72,371,932 36,185,966 18,092,983 54,278,950 27,139,475 81,418,426 40,709,213 122,127,640 61,063,820 30,531,910 15,265,955 45,797,866 22,898,933 68,696,800 34,348,400 17,174,200 8,587,100 4,293,550 2,146,775 6,440,326

← Previous Integer #4,701,083 Browse Full Index Next Integer #4,701,085 →