2,168,952

2³ × 3 × 90373

2,168,952 factors as 2^3 × 3 × 90373. Its 16 positive divisors give a proper-divisor sum of 3,253,488, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 90373

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,422,440

Proper Divisor Sum 3,253,488

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2168951 ← → #2168953

Radix Representation

Decimal	2168952
Binary	1000010001100001111000 (22 bits)
Octal	0o10214170
Hexadecimal	0x211878

Divisor Catalog (16)

1 2 3 4 6 8 12 24 90,373 180,746 271,119 361,492 542,238 722,984 1,084,476 2,168,952

Collatz Trajectory (91 steps to reach 1)

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

2,168,952 1,084,476 542,238 271,119 813,358 406,679 1,220,038 610,019 1,830,058 915,029 2,745,088 1,372,544 686,272 343,136 171,568 85,784 42,892 21,446 10,723 32,170 16,085 48,256 24,128 12,064 6,032 3,016 1,508 754 377 1,132 566 283 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079 3,238 1,619 4,858 2,429 7,288 3,644 1,822 911 2,734 1,367 4,102 2,051 6,154 3,077 9,232 4,616 2,308

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,168,951 Browse Full Index Next Integer #2,168,953 →