4,757,694

2 × 3 × 31 × 25579

4,757,694 factors as 2 × 3 × 31 × 25579. Its 16 positive divisors give a proper-divisor sum of 5,065,026, so this integer is abundant. The Collatz stopping time is 299 steps.

Prime Factor Structure

Factorization String 2 × 3 × 31 × 25579

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,822,720

Proper Divisor Sum 5,065,026

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4757677 ← → #4757707

Radix Representation

Decimal	4757694
Binary	10010001001100010111110 (23 bits)
Octal	0o22114276
Hexadecimal	0x4898BE

Divisor Catalog (16)

1 2 3 6 31 62 93 186 25,579 51,158 76,737 153,474 792,949 1,585,898 2,378,847 4,757,694

Collatz Trajectory (299 steps to reach 1)

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

4,757,694 2,378,847 7,136,542 3,568,271 10,704,814 5,352,407 16,057,222 8,028,611 24,085,834 12,042,917 36,128,752 18,064,376 9,032,188 4,516,094 2,258,047 6,774,142 3,387,071 10,161,214 5,080,607 15,241,822 7,620,911 22,862,734 11,431,367 34,294,102 17,147,051 51,441,154 25,720,577 77,161,732 38,580,866 19,290,433 57,871,300 28,935,650 14,467,825 43,403,476 21,701,738 10,850,869 32,552,608 16,276,304 8,138,152 4,069,076 2,034,538 1,017,269 3,051,808 1,525,904 762,952 381,476 190,738 95,369 286,108 143,054 71,527 214,582 107,291 321,874 160,937 482,812 241,406 120,703 362,110 181,055

← Previous Integer #4,757,693 Browse Full Index Next Integer #4,757,695 →