5,406,270

2 × 3 × 5 × 307 × 587

5,406,270 factors as 2 × 3 × 5 × 307 × 587. Its 32 positive divisors give a proper-divisor sum of 7,633,218, so this integer is abundant. The Collatz stopping time is 232 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 307 × 587

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 13,039,488

Proper Divisor Sum 7,633,218

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #5406257 ← → #5406281

Radix Representation

Decimal	5406270
Binary	10100100111111000111110 (23 bits)
Octal	0o24477076
Hexadecimal	0x527E3E

Divisor Catalog (32)

1 2 3 5 6 10 15 30 307 587 614 921 1,174 1,535 1,761 1,842 2,935 3,070 3,522 4,605 5,870 8,805 9,210 17,610 180,209 360,418 540,627 901,045 1,081,254 1,802,090 2,703,135 5,406,270

Collatz Trajectory (232 steps to reach 1)

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

5,406,270 2,703,135 8,109,406 4,054,703 12,164,110 6,082,055 18,246,166 9,123,083 27,369,250 13,684,625 41,053,876 20,526,938 10,263,469 30,790,408 15,395,204 7,697,602 3,848,801 11,546,404 5,773,202 2,886,601 8,659,804 4,329,902 2,164,951 6,494,854 3,247,427 9,742,282 4,871,141 14,613,424 7,306,712 3,653,356 1,826,678 913,339 2,740,018 1,370,009 4,110,028 2,055,014 1,027,507 3,082,522 1,541,261 4,623,784 2,311,892 1,155,946 577,973 1,733,920 866,960 433,480 216,740 108,370 54,185 162,556 81,278 40,639 121,918 60,959 182,878 91,439 274,318 137,159 411,478 205,739

← Previous Integer #5,406,269 Browse Full Index Next Integer #5,406,271 →