Recognised as Number

2,009,011

Positive
Odd
Prime
7 digits

2,009,011 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value2,009,011

Digit count7

Digit sum13

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2,009,011

Distinct prime factors12,009,011

Number of divisors2

Sum of divisors σ(n)2,009,012

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,009,010integers below n that share no factor with it

Carmichael function λ(n)2,009,010the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 2,009,0112 in total

Arithmetic

Previous number2,009,010

Next number2,009,012

Double4,018,022

Half1,004,505.5

Square4,036,125,198,121

Cube8,108,619,920,402,268,331

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

Cube root126.181040666≈

Negation-2,009,011

Reciprocal4.97757354 × 10^-7≈

Representations

Decimal2,009,011

Binary11110101001111011001121 bits

Octal7523663

Hexadecimal1EA7B3

Base 361725V

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

In wordstwo million, nine thousand and eleven

Ordinaltwo million, nine thousand and eleventh

Scientific notation2.009011 × 10^6

Engineering notation2.009011 × 10^6

In other bases

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

Quinary1003242021base 5; one hand: 10 digits

Septenary23035114base 7: 8 digits

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

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

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

Sexagesimal9:18:3:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000111101010011110110011

Bit length21 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits7within that length

Bit parityeven14 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 a7 b3

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

At each machine width

32-bit00000000000111101010011110110011

64-bit0000000000000000000000000000000000000000000111101010011110110011

One's complement11111111111000010101100001001100at 32 bits, every bit flipped

Bits reversed11001101111001010111100000000000at 32 bits

Rotated left by 100000000001111010100111101100110at 32 bits, wrapping

Shifted left by 11111010100111101100110= 4,018,022, no wrap

Shifted right by 111110101001111011001= 1,004,505, discarding the low bit

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

Nearest landmarks

Next prime2,009,039+28

Previous prime2,008,973−38

Distance to nearest prime0, it is prime

Nearest square below2,007,889

Nearest square above2,010,724

Powers & multiples

2,009,011 to the power 24,036,125,198,121

2,009,011 to the power 38,108,619,920,402,268,331

2,009,011 to the power 416,290,306,614,907,281,501,930,641

2,009,011 to the power 532,727,405,182,721,492,517,475,179,006,051

First ten multiples2,009,011, 4,018,022, 6,027,033, 8,036,044, 10,045,055, 12,054,066, 14,063,077, 16,072,088, 18,081,099, 20,090,110

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 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 7

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached9,040,5524× the starting value

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

First steps2,009,011 → 6,027,034 → 3,013,517 → 9,040,552 → 4,520,276 → 2,260,138 → 1,130,069 → 3,390,208 → 1,695,104 → 847,552 → …

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

As a percentage & fraction

As a percentage200,901,100%

2,009,011% as a decimal20,090.11

2,009,011% of 1002,009,011

2,009,011% of 1,00020,090,110

As a fraction of 1002,009,011/100

Read another way

As seconds23 days, 6 hours and 3 minutes

As bytes1.916 MiB

As a 24-bit colour#1EA7B3

Keep nerding

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