4,824,522

2 × 3⁷ × 1103

4,824,522 factors as 2 × 3^7 × 1103. Its 32 positive divisors give a proper-divisor sum of 6,038,838, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2 × 3^7 × 1103

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,863,360

Proper Divisor Sum 6,038,838

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4824517 ← → #4824529

Radix Representation

Decimal	4824522
Binary	10010011001110111001010 (23 bits)
Octal	0o22316712
Hexadecimal	0x499DCA

Divisor Catalog (32)

1 2 3 6 9 18 27 54 81 162 243 486 729 1,103 1,458 2,187 2,206 3,309 4,374 6,618 9,927 19,854 29,781 59,562 89,343 178,686 268,029 536,058 804,087 1,608,174 2,412,261 4,824,522

Collatz Trajectory (131 steps to reach 1)

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

4,824,522 2,412,261 7,236,784 3,618,392 1,809,196 904,598 452,299 1,356,898 678,449 2,035,348 1,017,674 508,837 1,526,512 763,256 381,628 190,814 95,407 286,222 143,111 429,334 214,667 644,002 322,001 966,004 483,002 241,501 724,504 362,252 181,126 90,563 271,690 135,845 407,536 203,768 101,884 50,942 25,471 76,414 38,207 114,622 57,311 171,934 85,967 257,902 128,951 386,854 193,427 580,282 290,141 870,424 435,212 217,606 108,803 326,410 163,205 489,616 244,808 122,404 61,202 30,601

← Previous Integer #4,824,521 Browse Full Index Next Integer #4,824,523 →