Recognised as Number
2,187,667
- Positive
- Odd
- Prime
- 7 digits
2,187,667 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,187,667
Digit count7
Digit sum37
Digit product28,224
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,187,667
Distinct prime factors12,187,667
Number of divisors2
Sum of divisors σ(n)2,187,668
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,187,666integers below n that share no factor with it
Carmichael function λ(n)2,187,666the 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,187,6672 in total
Arithmetic
Previous number2,187,666
Next number2,187,668
Double4,375,334
Half1,093,833.5
Square4,785,886,902,889
Cube10,469,926,843,182,469,963
Square root1,479.076401002≈irrational, shown to 9 decimal places
Cube root129.815655878≈
Negation-2,187,667
Reciprocal4.5710796 × 10^-7≈
Representations
Decimal2,187,667
Binary100001011000011001001122 bits
Octal10260623
Hexadecimal216193
Base 361AW0J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and eighty-seven thousand, six hundred and sixty-seven
Ordinaltwo million, one hundred and eighty-seven thousand, six hundred and sixty-seventh
Scientific notation2.187667 × 10^6
Engineering notation2.187667 × 10^6
In other bases
Ternary11010010220201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1030001132base 5; one hand: 10 digits
Septenary24411016base 7: 8 digits
Nonary4103821base 9; each digit is two ternary digits: 7 digits
Duodecimal896017base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldd937base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:7:41:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110100110T1T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101010011010010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010110000110010011
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes321 61 93
Gray code1100011101000101011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010110000110010011
64-bit0000000000000000000000000000000000000000001000010110000110010011
One's complement11111111110111101001111001101100at 32 bits, every bit flipped
Bits reversed11001001100001101000010000000000at 32 bits
Rotated left by 100000000010000101100001100100110at 32 bits, wrapping
Shifted left by 110000101100001100100110= 4,375,334, no wrap
Shifted right by 1100001011000011001001= 1,093,833, discarding the low bit
These bits as a double1.08085111 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,187,667 to the power 24,785,886,902,889
2,187,667 to the power 310,469,926,843,182,469,963
2,187,667 to the power 422,904,713,447,244,464,516,546,321
2,187,667 to the power 550,107,885,752,992,955,955,519,340,423,107
First ten multiples2,187,667, 4,375,334, 6,563,001, 8,750,668, 10,938,335, 13,126,002, 15,313,669, 17,501,336, 19,689,003, 21,876,670
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1171the total stopping time
Highest value reached9,844,5044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,187,667 → 6,563,002 → 3,281,501 → 9,844,504 → 4,922,252 → 2,461,126 → 1,230,563 → 3,691,690 → 1,845,845 → 5,537,536 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage218,766,700%
2,187,667% as a decimal21,876.67
2,187,667% of 1002,187,667
2,187,667% of 1,00021,876,670
As a fraction of 1002,187,667/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,187,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page