4,463,068

2² × 1115767

4,463,068 factors as 2^2 × 1115767. Its 6 positive divisors give a proper-divisor sum of 3,347,308, so this integer is deficient. The Collatz stopping time is 118 steps.

Prime Factor Structure

Factorization String 2^2 × 1115767

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 6

Divisor Sum (σ) 7,810,376

Proper Divisor Sum 3,347,308

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #4463059 ← → #4463111

Radix Representation

Decimal	4463068
Binary	10001000001100111011100 (23 bits)
Octal	0o21014734
Hexadecimal	0x4419DC

Divisor Catalog (6)

1 2 4 1,115,767 2,231,534 4,463,068

Collatz Trajectory (118 steps to reach 1)

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

4,463,068 2,231,534 1,115,767 3,347,302 1,673,651 5,020,954 2,510,477 7,531,432 3,765,716 1,882,858 941,429 2,824,288 1,412,144 706,072 353,036 176,518 88,259 264,778 132,389 397,168 198,584 99,292 49,646 24,823 74,470 37,235 111,706 55,853 167,560 83,780 41,890 20,945 62,836 31,418 15,709 47,128 23,564 11,782 5,891 17,674 8,837 26,512 13,256 6,628 3,314 1,657 4,972 2,486 1,243 3,730 1,865 5,596 2,798 1,399 4,198 2,099 6,298 3,149 9,448 4,724

← Previous Integer #4,463,067 Browse Full Index Next Integer #4,463,069 →