4,264,456

2³ × 7 × 271 × 281

4,264,456 factors as 2^3 × 7 × 271 × 281. Its 32 positive divisors give a proper-divisor sum of 4,940,024, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 271 × 281

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,204,480

Proper Divisor Sum 4,940,024

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #4264409 ← → #4264471

Radix Representation

Decimal	4264456
Binary	10000010001001000001000 (23 bits)
Octal	0o20211010
Hexadecimal	0x411208

Divisor Catalog (32)

1 2 4 7 8 14 28 56 271 281 542 562 1,084 1,124 1,897 1,967 2,168 2,248 3,794 3,934 7,588 7,868 15,176 15,736 76,151 152,302 304,604 533,057 609,208 1,066,114 2,132,228 4,264,456

Collatz Trajectory (105 steps to reach 1)

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

4,264,456 2,132,228 1,066,114 533,057 1,599,172 799,586 399,793 1,199,380 599,690 299,845 899,536 449,768 224,884 112,442 56,221 168,664 84,332 42,166 21,083 63,250 31,625 94,876 47,438 23,719 71,158 35,579 106,738 53,369 160,108 80,054 40,027 120,082 60,041 180,124 90,062 45,031 135,094 67,547 202,642 101,321 303,964 151,982 75,991 227,974 113,987 341,962 170,981 512,944 256,472 128,236 64,118 32,059 96,178 48,089 144,268 72,134 36,067 108,202 54,101 162,304

← Previous Integer #4,264,455 Browse Full Index Next Integer #4,264,457 →