Recognised as Number

2,003,291

Positive
Odd
Composite
7 digits

2,003,291 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value2,003,291

Digit count7

Digit sum17

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation29 × 37 × 1,867

Distinct prime factors329, 37, 1,867

Number of divisors8

Sum of divisors σ(n)2,129,520

Aliquot sum126,229sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,880,928integers below n that share no factor with it

Carmichael function λ(n)78,372the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,880,928

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 29, 37, 1,073, 1,867, 54,143, 69,079, 2,003,2918 in total

Arithmetic

Previous number2,003,290

Next number2,003,292

Double4,006,582

Half1,001,645.5

Square4,013,174,830,681

Cube8,039,557,019,729,771,171

Square root1,415.376628322≈irrational, shown to 9 decimal places

Cube root126.061173789≈

Negation-2,003,291

Reciprocal4.99178602 × 10^-7≈

Representations

Decimal2,003,291

Binary11110100100010101101121 bits

Octal7510533

Hexadecimal1E915B

Base 3616XQZ

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwo million, three thousand, two hundred and ninety-one

Ordinaltwo million, three thousand, two hundred and ninety-first

Scientific notation2.003291 × 10^6

Engineering notation2.003291 × 10^6

In other bases

Ternary10202202222222base 3; the most digit-efficient integer base after e: 14 digits

Quinary1003101131base 5; one hand: 10 digits

Septenary23012333base 7: 8 digits

Nonary3682888base 9; each digit is two ternary digits: 7 digits

Duodecimal80738bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimalca84bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal9:16:28:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary11T10T1000000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11000111001011010101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000111101001000101011011

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 set bits, so even; not the same as the number itself being odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes31e 91 5b

Gray code100011101100111110110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000111101001000101011011

64-bit0000000000000000000000000000000000000000000111101001000101011011

One's complement11111111111000010110111010100100at 32 bits, every bit flipped

Bits reversed11011010100010010111100000000000at 32 bits

Rotated left by 100000000001111010010001010110110at 32 bits, wrapping

Shifted left by 11111010010001010110110= 4,006,582, no wrap

Shifted right by 111110100100010101101= 1,001,645, discarding the low bit

These bits as a double9.89757262 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,003,299+8

Previous prime2,003,279−12

Distance to nearest prime8

Nearest square below2,002,225

Nearest square above2,005,056

Powers & multiples

2,003,291 to the power 24,013,174,830,681

2,003,291 to the power 38,039,557,019,729,771,171

2,003,291 to the power 416,105,572,221,611,473,018,923,761

2,003,291 to the power 532,264,147,881,404,269,395,552,800,097,451

First ten multiples2,003,291, 4,006,582, 6,009,873, 8,013,164, 10,016,455, 12,019,746, 14,023,037, 16,026,328, 18,029,619, 20,032,910

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 11

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1166the total stopping time

Highest value reached15,212,5007× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps2,003,291 → 6,009,874 → 3,004,937 → 9,014,812 → 4,507,406 → 2,253,703 → 6,761,110 → 3,380,555 → 10,141,666 → 5,070,833 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage200,329,100%

2,003,291% as a decimal20,032.91

2,003,291% of 1002,003,291

2,003,291% of 1,00020,032,910

As a fraction of 1002,003,291/100

Read another way

As seconds23 days, 4 hours and 28 minutes

As bytes1.91 MiB

As a 24-bit colour#1E915B

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.