8,369,366

2 × 1033 × 4051

8,369,366 factors as 2 × 1033 × 4051. Its 8 positive divisors give a proper-divisor sum of 4,199,938, so this integer is deficient. The Collatz stopping time is 75 steps.

Prime Factor Structure

Factorization String 2 × 1033 × 4051

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,569,304

Proper Divisor Sum 4,199,938

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #8369359 ← → #8369381

Radix Representation

Decimal	8369366
Binary	11111111011010011010110 (23 bits)
Octal	0o37732326
Hexadecimal	0x7FB4D6

Divisor Catalog (8)

1 2 1,033 2,066 4,051 8,102 4,184,683 8,369,366

Collatz Trajectory (75 steps to reach 1)

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

8,369,366 4,184,683 12,554,050 6,277,025 18,831,076 9,415,538 4,707,769 14,123,308 7,061,654 3,530,827 10,592,482 5,296,241 15,888,724 7,944,362 3,972,181 11,916,544 5,958,272 2,979,136 1,489,568 744,784 372,392 186,196 93,098 46,549 139,648 69,824 34,912 17,456 8,728 4,364 2,182 1,091 3,274 1,637 4,912 2,456 1,228 614 307 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,369,365 Browse Full Index Next Integer #8,369,367 →