Recognised as Number
2,007,209
- Positive
- Odd
- Prime
- 7 digits
2,007,209 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,007,209
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,007,209
Distinct prime factors12,007,209
Number of divisors2
Sum of divisors σ(n)2,007,210
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,007,208integers below n that share no factor with it
Carmichael function λ(n)2,007,208the 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,007,2092 in total
Arithmetic
Previous number2,007,208
Next number2,007,210
Double4,014,418
Half1,003,604.5
Square4,028,887,969,681
Cube8,086,820,192,735,430,329
Square root1,416.760036139≈irrational, shown to 9 decimal places
Cube root126.143302984≈
Negation-2,007,209
Reciprocal4.98204223 × 10^-7≈
Representations
Decimal2,007,209
Binary11110101000001010100121 bits
Octal7520251
Hexadecimal1EA0A9
Base 36170RT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven thousand, two hundred and nine
Ordinaltwo million, seven thousand, two hundred and ninth
Scientific notation2.007209 × 10^6
Engineering notation2.007209 × 10^6
In other bases
Ternary10202222101002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003212314base 5; one hand: 10 digits
Septenary23026631base 7: 8 digits
Nonary3688332base 9; each digit is two ternary digits: 7 digits
Duodecimal8096b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcai09base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:17:33:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1000T10101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111110000111111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101010000010101001
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 a0 a9
Gray code100011111000011111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101010000010101001
64-bit0000000000000000000000000000000000000000000111101010000010101001
One's complement11111111111000010101111101010110at 32 bits, every bit flipped
Bits reversed10010101000001010111100000000000at 32 bits
Rotated left by 100000000001111010100000101010010at 32 bits, wrapping
Shifted left by 11111010100000101010010= 4,014,418, no wrap
Shifted right by 111110101000001010100= 1,003,604, discarding the low bit
These bits as a double9.91693011 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,007,209 to the power 24,028,887,969,681
2,007,209 to the power 38,086,820,192,735,430,329
2,007,209 to the power 416,231,938,272,240,290,375,241,761
2,007,209 to the power 532,580,892,587,485,161,003,798,639,855,049
First ten multiples2,007,209, 4,014,418, 6,021,627, 8,028,836, 10,036,045, 12,043,254, 14,050,463, 16,057,672, 18,064,881, 20,072,090
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1215the total stopping time
Highest value reached51,442,61225× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,007,209 → 6,021,628 → 3,010,814 → 1,505,407 → 4,516,222 → 2,258,111 → 6,774,334 → 3,387,167 → 10,161,502 → 5,080,751 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage200,720,900%
2,007,209% as a decimal20,072.09
2,007,209% of 1002,007,209
2,007,209% of 1,00020,072,090
As a fraction of 1002,007,209/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,007,209
Nerdulate something else
Nothing in mind? Surprise me · today’s page