1,527,114

2 × 3 × 254519

1,527,114 factors as 2 × 3 × 254519. Its 8 positive divisors give a proper-divisor sum of 1,527,126, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3 × 254519

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,054,240

Proper Divisor Sum 1,527,126

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1527109 ← → #1527121

Radix Representation

Decimal	1527114
Binary	101110100110101001010 (21 bits)
Octal	0o5646512
Hexadecimal	0x174D4A

Divisor Catalog (8)

1 2 3 6 254,519 509,038 763,557 1,527,114

Collatz Trajectory (132 steps to reach 1)

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

1,527,114 763,557 2,290,672 1,145,336 572,668 286,334 143,167 429,502 214,751 644,254 322,127 966,382 483,191 1,449,574 724,787 2,174,362 1,087,181 3,261,544 1,630,772 815,386 407,693 1,223,080 611,540 305,770 152,885 458,656 229,328 114,664 57,332 28,666 14,333 43,000 21,500 10,750 5,375 16,126 8,063 24,190 12,095 36,286 18,143 54,430 27,215 81,646 40,823 122,470 61,235 183,706 91,853 275,560 137,780 68,890 34,445 103,336 51,668 25,834 12,917 38,752 19,376 9,688

More profiles

4,908,897 4,396,511 8,373,642 519,131 9,177,782 7,578,066 1,695,636 228,026 9,301,028 8,303,951 5,224,177 6,890,198 4,496,203 9,119,083 2,844,938 1,870,942

← Previous Integer #1,527,113 Browse Full Index Next Integer #1,527,115 →