4,080,392

2³ × 510049

4,080,392 factors as 2^3 × 510049. Its 8 positive divisors give a proper-divisor sum of 3,570,358, so this integer is deficient. The Collatz stopping time is 291 steps.

Prime Factor Structure

Factorization String 2^3 × 510049

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,650,750

Proper Divisor Sum 3,570,358

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #4080359 ← → #4080403

Radix Representation

Decimal	4080392
Binary	1111100100001100001000 (22 bits)
Octal	0o17441410
Hexadecimal	0x3E4308

Divisor Catalog (8)

1 2 4 8 510,049 1,020,098 2,040,196 4,080,392

Collatz Trajectory (291 steps to reach 1)

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

4,080,392 2,040,196 1,020,098 510,049 1,530,148 765,074 382,537 1,147,612 573,806 286,903 860,710 430,355 1,291,066 645,533 1,936,600 968,300 484,150 242,075 726,226 363,113 1,089,340 544,670 272,335 817,006 408,503 1,225,510 612,755 1,838,266 919,133 2,757,400 1,378,700 689,350 344,675 1,034,026 517,013 1,551,040 775,520 387,760 193,880 96,940 48,470 24,235 72,706 36,353 109,060 54,530 27,265 81,796 40,898 20,449 61,348 30,674 15,337 46,012 23,006 11,503 34,510 17,255 51,766 25,883

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,080,391 Browse Full Index Next Integer #4,080,393 →