9,047,722

2 × 31 × 145931

9,047,722 factors as 2 × 31 × 145931. Its 8 positive divisors give a proper-divisor sum of 4,961,750, so this integer is deficient. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 31 × 145931

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 14,009,472

Proper Divisor Sum 4,961,750

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #9047719 ← → #9047729

Radix Representation

Decimal	9047722
Binary	100010100000111010101010 (24 bits)
Octal	0o42407252
Hexadecimal	0x8A0EAA

Divisor Catalog (8)

1 2 31 62 145,931 291,862 4,523,861 9,047,722

Collatz Trajectory (88 steps to reach 1)

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

9,047,722 4,523,861 13,571,584 6,785,792 3,392,896 1,696,448 848,224 424,112 212,056 106,028 53,014 26,507 79,522 39,761 119,284 59,642 29,821 89,464 44,732 22,366 11,183 33,550 16,775 50,326 25,163 75,490 37,745 113,236 56,618 28,309 84,928 42,464 21,232 10,616 5,308 2,654 1,327 3,982 1,991 5,974 2,987 8,962 4,481 13,444 6,722 3,361 10,084 5,042 2,521 7,564 3,782 1,891 5,674 2,837 8,512 4,256 2,128 1,064 532 266

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,047,721 Browse Full Index Next Integer #9,047,723 →