10,690,440

2³ × 3 × 5 × 89087

10,690,440 factors as 2^3 × 3 × 5 × 89087. Its 32 positive divisors give a proper-divisor sum of 21,381,240, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 89087

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 32,071,680

Proper Divisor Sum 21,381,240

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #10690411 ← → #10690441

Radix Representation

Decimal	10690440
Binary	101000110001111110001000 (24 bits)
Octal	0o50617610
Hexadecimal	0xA31F88

Divisor Catalog (32)

Collatz Trajectory (145 steps to reach 1)

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

10,690,440 5,345,220 2,672,610 1,336,305 4,008,916 2,004,458 1,002,229 3,006,688 1,503,344 751,672 375,836 187,918 93,959 281,878 140,939 422,818 211,409 634,228 317,114 158,557 475,672 237,836 118,918 59,459 178,378 89,189 267,568 133,784 66,892 33,446 16,723 50,170 25,085 75,256 37,628 18,814 9,407 28,222 14,111 42,334 21,167 63,502 31,751 95,254 47,627 142,882 71,441 214,324 107,162 53,581 160,744 80,372 40,186 20,093 60,280 30,140 15,070 7,535 22,606 11,303

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #10,690,439 Browse Full Index Next Integer #10,690,441 →