3,050,402

2 × 101 × 15101

3,050,402 factors as 2 × 101 × 15101. Its 8 positive divisors give a proper-divisor sum of 1,570,810, so this integer is deficient. The Collatz stopping time is 133 steps.

Prime Factor Structure

Factorization String 2 × 101 × 15101

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,621,212

Proper Divisor Sum 1,570,810

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #3050401 ← → #3050419

Radix Representation

Decimal	3050402
Binary	1011101000101110100010 (22 bits)
Octal	0o13505642
Hexadecimal	0x2E8BA2

Divisor Catalog (8)

1 2 101 202 15,101 30,202 1,525,201 3,050,402

Collatz Trajectory (133 steps to reach 1)

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

3,050,402 1,525,201 4,575,604 2,287,802 1,143,901 3,431,704 1,715,852 857,926 428,963 1,286,890 643,445 1,930,336 965,168 482,584 241,292 120,646 60,323 180,970 90,485 271,456 135,728 67,864 33,932 16,966 8,483 25,450 12,725 38,176 19,088 9,544 4,772 2,386 1,193 3,580 1,790 895 2,686 1,343 4,030 2,015 6,046 3,023 9,070 4,535 13,606 6,803 20,410 10,205 30,616 15,308 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230

← Previous Integer #3,050,401 Browse Full Index Next Integer #3,050,403 →