4,656,129

3 × 367 × 4229

4,656,129 factors as 3 × 367 × 4229. Its 8 positive divisors give a proper-divisor sum of 1,570,431, so this integer is deficient. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 3 × 367 × 4229

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,226,560

Proper Divisor Sum 1,570,431

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4656089 ← → #4656139

Radix Representation

Decimal	4656129
Binary	10001110000110000000001 (23 bits)
Octal	0o21606001
Hexadecimal	0x470C01

Divisor Catalog (8)

1 3 367 1,101 4,229 12,687 1,552,043 4,656,129

Collatz Trajectory (87 steps to reach 1)

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

4,656,129 13,968,388 6,984,194 3,492,097 10,476,292 5,238,146 2,619,073 7,857,220 3,928,610 1,964,305 5,892,916 2,946,458 1,473,229 4,419,688 2,209,844 1,104,922 552,461 1,657,384 828,692 414,346 207,173 621,520 310,760 155,380 77,690 38,845 116,536 58,268 29,134 14,567 43,702 21,851 65,554 32,777 98,332 49,166 24,583 73,750 36,875 110,626 55,313 165,940 82,970 41,485 124,456 62,228 31,114 15,557 46,672 23,336 11,668 5,834 2,917 8,752 4,376 2,188 1,094 547 1,642 821

← Previous Integer #4,656,128 Browse Full Index Next Integer #4,656,130 →