4,295,800

2³ × 5² × 47 × 457

4,295,800 factors as 2^3 × 5^2 × 47 × 457. Its 48 positive divisors give a proper-divisor sum of 5,926,760, so this integer is abundant. The Collatz stopping time is 273 steps.

Prime Factor Structure

Factorization String 2^3 × 5^2 × 47 × 457

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 10,222,560

Proper Divisor Sum 5,926,760

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #4295791 ← → #4295801

Radix Representation

Decimal	4295800
Binary	10000011000110001111000 (23 bits)
Octal	0o20306170
Hexadecimal	0x418C78

Divisor Catalog (48)

1 2 4 5 8 10 20 25 40 47 50 94 100 188 200 235 376 457 470 914 940 1,175 1,828 1,880 2,285 2,350 3,656 4,570 4,700 9,140 9,400 11,425 18,280 21,479 22,850 42,958 45,700 85,916 91,400 107,395 171,832 214,790 429,580 536,975 859,160 1,073,950 2,147,900 4,295,800

Collatz Trajectory (273 steps to reach 1)

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

4,295,800 2,147,900 1,073,950 536,975 1,610,926 805,463 2,416,390 1,208,195 3,624,586 1,812,293 5,436,880 2,718,440 1,359,220 679,610 339,805 1,019,416 509,708 254,854 127,427 382,282 191,141 573,424 286,712 143,356 71,678 35,839 107,518 53,759 161,278 80,639 241,918 120,959 362,878 181,439 544,318 272,159 816,478 408,239 1,224,718 612,359 1,837,078 918,539 2,755,618 1,377,809 4,133,428 2,066,714 1,033,357 3,100,072 1,550,036 775,018 387,509 1,162,528 581,264 290,632 145,316 72,658 36,329 108,988 54,494 27,247

← Previous Integer #4,295,799 Browse Full Index Next Integer #4,295,801 →