53,470,128

2⁴ × 3 × 1113961

53,470,128 factors as 2^4 × 3 × 1113961. Its 20 positive divisors give a proper-divisor sum of 84,661,160, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 1113961

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 138,131,288

Proper Divisor Sum 84,661,160

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #53470121 ← → #53470129

Radix Representation

Decimal	53470128
Binary	11001011111110001110110000 (26 bits)
Octal	0o313761660
Hexadecimal	0x32FE3B0

Divisor Catalog (20)

Collatz Trajectory (88 steps to reach 1)

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

53,470,128 26,735,064 13,367,532 6,683,766 3,341,883 10,025,650 5,012,825 15,038,476 7,519,238 3,759,619 11,278,858 5,639,429 16,918,288 8,459,144 4,229,572 2,114,786 1,057,393 3,172,180 1,586,090 793,045 2,379,136 1,189,568 594,784 297,392 148,696 74,348 37,174 18,587 55,762 27,881 83,644 41,822 20,911 62,734 31,367 94,102 47,051 141,154 70,577 211,732 105,866 52,933 158,800 79,400 39,700 19,850 9,925 29,776 14,888 7,444 3,722 1,861 5,584 2,792 1,396 698 349 1,048 524 262

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #53,470,127 Browse Full Index Next Integer #53,470,129 →