1,485,136

2⁴ × 92821

1,485,136 factors as 2^4 × 92821. Its 10 positive divisors give a proper-divisor sum of 1,392,346, so this integer is deficient. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^4 × 92821

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 10

Divisor Sum (σ) 2,877,482

Proper Divisor Sum 1,392,346

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #1485109 ← → #1485139

Radix Representation

Decimal	1485136
Binary	101101010100101010000 (21 bits)
Octal	0o5524520
Hexadecimal	0x16A950

Divisor Catalog (10)

1 2 4 8 16 92,821 185,642 371,284 742,568 1,485,136

Collatz Trajectory (88 steps to reach 1)

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

1,485,136 742,568 371,284 185,642 92,821 278,464 139,232 69,616 34,808 17,404 8,702 4,351 13,054 6,527 19,582 9,791 29,374 14,687 44,062 22,031 66,094 33,047 99,142 49,571 148,714 74,357 223,072 111,536 55,768 27,884 13,942 6,971 20,914 10,457 31,372 15,686 7,843 23,530 11,765 35,296 17,648 8,824 4,412 2,206 1,103 3,310 1,655 4,966 2,483 7,450 3,725 11,176 5,588 2,794 1,397 4,192 2,096 1,048 524 262

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,485,135 Browse Full Index Next Integer #1,485,137 →