3,903,380

2² × 5 × 13 × 15013

3,903,380 factors as 2^2 × 5 × 13 × 15013. Its 24 positive divisors give a proper-divisor sum of 4,924,852, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 13 × 15013

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,828,232

Proper Divisor Sum 4,924,852

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #3903373 ← → #3903401

Radix Representation

Decimal	3903380
Binary	1110111000111110010100 (22 bits)
Octal	0o16707624
Hexadecimal	0x3B8F94

Divisor Catalog (24)

1 2 4 5 10 13 20 26 52 65 130 260 15,013 30,026 60,052 75,065 150,130 195,169 300,260 390,338 780,676 975,845 1,951,690 3,903,380

Collatz Trajectory (185 steps to reach 1)

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

3,903,380 1,951,690 975,845 2,927,536 1,463,768 731,884 365,942 182,971 548,914 274,457 823,372 411,686 205,843 617,530 308,765 926,296 463,148 231,574 115,787 347,362 173,681 521,044 260,522 130,261 390,784 195,392 97,696 48,848 24,424 12,212 6,106 3,053 9,160 4,580 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900 2,450 1,225 3,676 1,838 919 2,758 1,379 4,138

← Previous Integer #3,903,379 Browse Full Index Next Integer #3,903,381 →