903,552

2⁷ × 3 × 13 × 181

903,552 factors as 2^7 × 3 × 13 × 181. Its 64 positive divisors give a proper-divisor sum of 1,695,408, so this integer is abundant. The Collatz stopping time is 64 steps.

Prime Factor Structure

Factorization String 2^7 × 3 × 13 × 181

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 2,598,960

Proper Divisor Sum 1,695,408

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #903547 ← → #903563

Radix Representation

Decimal	903552
Binary	11011100100110000000 (20 bits)
Octal	0o3344600
Hexadecimal	0xDC980

Divisor Catalog (60 of 64)

1 2 3 4 6 8 12 13 16 24 26 32 39 48 52 64 78 96 104 128 156 181 192 208 312 362 384 416 543 624 724 832 1,086 1,248 1,448 1,664 2,172 2,353 2,496 2,896 4,344 4,706 4,992 5,792 7,059 8,688 9,412 11,584 14,118 17,376 18,824 23,168 28,236 34,752 37,648 56,472 69,504 75,296 112,944 150,592

Collatz Trajectory (64 steps to reach 1)

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

903,552 451,776 225,888 112,944 56,472 28,236 14,118 7,059 21,178 10,589 31,768 15,884 7,942 3,971 11,914 5,957 17,872 8,936 4,468 2,234 1,117 3,352 1,676 838 419 1,258 629 1,888 944 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #903,551 Browse Full Index Next Integer #903,553 →