4,295,690

2 × 5 × 7 × 109 × 563

4,295,690 factors as 2 × 5 × 7 × 109 × 563. Its 32 positive divisors give a proper-divisor sum of 4,638,070, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 109 × 563

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 8,933,760

Proper Divisor Sum 4,638,070

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #4295689 ← → #4295699

Radix Representation

Decimal	4295690
Binary	10000011000110000001010 (23 bits)
Octal	0o20306012
Hexadecimal	0x418C0A

Divisor Catalog (32)

1 2 5 7 10 14 35 70 109 218 545 563 763 1,090 1,126 1,526 2,815 3,815 3,941 5,630 7,630 7,882 19,705 39,410 61,367 122,734 306,835 429,569 613,670 859,138 2,147,845 4,295,690

Collatz Trajectory (74 steps to reach 1)

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

4,295,690 2,147,845 6,443,536 3,221,768 1,610,884 805,442 402,721 1,208,164 604,082 302,041 906,124 453,062 226,531 679,594 339,797 1,019,392 509,696 254,848 127,424 63,712 31,856 15,928 7,964 3,982 1,991 5,974 2,987 8,962 4,481 13,444 6,722 3,361 10,084 5,042 2,521 7,564 3,782 1,891 5,674 2,837 8,512 4,256 2,128 1,064 532 266 133 400 200 100 50 25 76 38 19 58 29 88 44 22

← Previous Integer #4,295,689 Browse Full Index Next Integer #4,295,691 →