4,690,434

2 × 3 × 7 × 181 × 617

4,690,434 factors as 2 × 3 × 7 × 181 × 617. Its 32 positive divisors give a proper-divisor sum of 6,107,262, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 181 × 617

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,797,696

Proper Divisor Sum 6,107,262

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4690417 ← → #4690451

Radix Representation

Decimal	4690434
Binary	10001111001001000000010 (23 bits)
Octal	0o21711002
Hexadecimal	0x479202

Divisor Catalog (32)

1 2 3 6 7 14 21 42 181 362 543 617 1,086 1,234 1,267 1,851 2,534 3,702 3,801 4,319 7,602 8,638 12,957 25,914 111,677 223,354 335,031 670,062 781,739 1,563,478 2,345,217 4,690,434

Collatz Trajectory (105 steps to reach 1)

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

4,690,434 2,345,217 7,035,652 3,517,826 1,758,913 5,276,740 2,638,370 1,319,185 3,957,556 1,978,778 989,389 2,968,168 1,484,084 742,042 371,021 1,113,064 556,532 278,266 139,133 417,400 208,700 104,350 52,175 156,526 78,263 234,790 117,395 352,186 176,093 528,280 264,140 132,070 66,035 198,106 99,053 297,160 148,580 74,290 37,145 111,436 55,718 27,859 83,578 41,789 125,368 62,684 31,342 15,671 47,014 23,507 70,522 35,261 105,784 52,892 26,446 13,223 39,670 19,835 59,506 29,753

← Previous Integer #4,690,433 Browse Full Index Next Integer #4,690,435 →