Recognised as Number
2,009,249
- Positive
- Odd
- Composite
- 7 digits
2,009,249 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,009,249
Digit count7
Digit sum26
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 factorisation11 × 182,659
Distinct prime factors211, 182,659
Number of divisors4
Sum of divisors σ(n)2,191,920
Aliquot sum182,671sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,826,580integers below n that share no factor with it
Carmichael function λ(n)913,290the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,826,580
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 182,659, 2,009,2494 in total
Arithmetic
Previous number2,009,248
Next number2,009,250
Double4,018,498
Half1,004,624.5
Square4,037,081,544,001
Cube8,111,502,055,202,465,249
Square root1,417.479805853≈irrational, shown to 9 decimal places
Cube root126.186023201≈
Negation-2,009,249
Reciprocal4.97698394 × 10^-7≈
Representations
Decimal2,009,249
Binary11110101010001010000121 bits
Octal7524241
Hexadecimal1EA8A1
Base 36172CH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine thousand, two hundred and forty-nine
Ordinaltwo million, nine thousand, two hundred and forty-ninth
Scientific notation2.009249 × 10^6
Engineering notation2.009249 × 10^6
In other bases
Ternary10210002011122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003243444base 5; one hand: 10 digits
Septenary23035604base 7: 8 digits
Nonary3702148base 9; each digit is two ternary digits: 7 digits
Duodecimal80a915base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcb329base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:18:7:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1001T1TTT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111111100111100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101010100010100001
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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 a8 a1
Gray code100011111110011110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101010100010100001
64-bit0000000000000000000000000000000000000000000111101010100010100001
One's complement11111111111000010101011101011110at 32 bits, every bit flipped
Bits reversed10000101000101010111100000000000at 32 bits
Rotated left by 100000000001111010101000101000010at 32 bits, wrapping
Shifted left by 11111010101000101000010= 4,018,498, no wrap
Shifted right by 111110101010001010000= 1,004,624, discarding the low bit
These bits as a double9.92700905 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,009,249 to the power 24,037,081,544,001
2,009,249 to the power 38,111,502,055,202,465,249
2,009,249 to the power 416,298,027,392,913,498,099,088,001
2,009,249 to the power 532,746,795,241,184,053,142,094,466,921,249
First ten multiples2,009,249, 4,018,498, 6,027,747, 8,036,996, 10,046,245, 12,055,494, 14,064,743, 16,073,992, 18,083,241, 20,092,490
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1166the total stopping time
Highest value reached49,547,03224× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,009,249 → 6,027,748 → 3,013,874 → 1,506,937 → 4,520,812 → 2,260,406 → 1,130,203 → 3,390,610 → 1,695,305 → 5,085,916 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage200,924,900%
2,009,249% as a decimal20,092.49
2,009,249% of 1002,009,249
2,009,249% of 1,00020,092,490
As a fraction of 1002,009,249/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 2,009,249
Nerdulate something else
Nothing in mind? Surprise me · today’s page