Recognised as Number
2,066,887
- Positive
- Odd
- Prime
- 7 digits
2,066,887 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,066,887
Digit count7
Digit sum37
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,066,887
Distinct prime factors12,066,887
Number of divisors2
Sum of divisors σ(n)2,066,888
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,066,886integers below n that share no factor with it
Carmichael function λ(n)2,066,886the 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,066,8872 in total
Arithmetic
Previous number2,066,886
Next number2,066,888
Double4,133,774
Half1,033,443.5
Square4,272,021,870,769
Cube8,829,786,468,408,126,103
Square root1,437.667207667≈irrational, shown to 9 decimal places
Cube root127.381270993≈
Negation-2,066,887
Reciprocal4.83819386 × 10^-7≈
Representations
Decimal2,066,887
Binary11111100010011100011121 bits
Octal7704707
Hexadecimal1F89C7
Base 3618ATJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, sixty-six thousand, eight hundred and eighty-seven
Ordinaltwo million, sixty-six thousand, eight hundred and eighty-seventh
Scientific notation2.066887 × 10^6
Engineering notation2.066887 × 10^6
In other bases
Ternary10220000020101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1012120022base 5; one hand: 10 digits
Septenary23365624base 7: 8 digits
Nonary3800211base 9; each digit is two ternary digits: 7 digits
Duodecimal838147base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalci747base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:34:8:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110T00001T0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000001001111011011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111111000100111000111
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; 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
Bytes31f 89 c7
Gray code100000100110100100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111111000100111000111
64-bit0000000000000000000000000000000000000000000111111000100111000111
One's complement11111111111000000111011000111000at 32 bits, every bit flipped
Bits reversed11100011100100011111100000000000at 32 bits
Rotated left by 100000000001111110001001110001110at 32 bits, wrapping
Shifted left by 11111110001001110001110= 4,133,774, no wrap
Shifted right by 111111100010011100011= 1,033,443, discarding the low bit
These bits as a double1.02117786 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,066,887 to the power 24,272,021,870,769
2,066,887 to the power 38,829,786,468,408,126,103
2,066,887 to the power 418,250,170,864,328,666,536,651,361
2,066,887 to the power 537,721,040,907,259,684,591,939,721,583,207
First ten multiples2,066,887, 4,133,774, 6,200,661, 8,267,548, 10,334,435, 12,401,322, 14,468,209, 16,535,096, 18,601,983, 20,668,870
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1166the total stopping time
Highest value reached13,951,4926× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,066,887 → 6,200,662 → 3,100,331 → 9,300,994 → 4,650,497 → 13,951,492 → 6,975,746 → 3,487,873 → 10,463,620 → 5,231,810 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage206,688,700%
2,066,887% as a decimal20,668.87
2,066,887% of 1002,066,887
2,066,887% of 1,00020,668,870
As a fraction of 1002,066,887/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,066,887
Nerdulate something else
Nothing in mind? Surprise me · today’s page