Recognised as Number
2,687,022
- Positive
- Even
- Composite
- 7 digits
2,687,022 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,687,022
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 13 × 11,483
Distinct prime factors42, 3, 13, 11,483
Number of divisors24
Sum of divisors σ(n)6,270,264
Aliquot sum3,583,242sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)826,704integers below n that share no factor with it
Carmichael function λ(n)68,892the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 826,704
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 13, 18, 26, 39, 78, 117, 234, 11,483, 22,966, 34,449, 68,898, 103,347, 149,279, 206,694, 298,558, 447,837, 895,674, 1,343,511, 2,687,02224 in total
Arithmetic
Previous number2,687,021
Next number2,687,023
Double5,374,044
Half1,343,511
Square7,220,087,228,484
Cube19,400,533,224,855,534,648
Square root1,639.213835959≈irrational, shown to 9 decimal places
Cube root139.024200883≈
Negation-2,687,022
Reciprocal3.72159216 × 10^-7≈
Representations
Decimal2,687,022
Binary101001000000000010111022 bits
Octal12200056
Hexadecimal29002E
Base 361LLBI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and eighty-seven thousand and twenty-two
Ordinaltwo million, six hundred and eighty-seven thousand and twenty-second
Scientific notation2.687022 × 10^6
Engineering notation2.687022 × 10^6
In other bases
Ternary12001111220100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1141441042base 5; one hand: 10 digits
Septenary31560612base 7: 8 digits
Nonary5044810base 9; each digit is two ternary digits: 7 digits
Duodecimala96ba6base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgfhb2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:26:23:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT01TTTT0T0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010000000001110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010000000000101110
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes329 00 2e
Gray code1111011000000000111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010000000000101110
64-bit0000000000000000000000000000000000000000001010010000000000101110
One's complement11111111110101101111111111010001at 32 bits, every bit flipped
Bits reversed01110100000000001001010000000000at 32 bits
Rotated left by 100000000010100100000000001011100at 32 bits, wrapping
Shifted left by 110100100000000001011100= 5,374,044, no wrap
Shifted right by 1101001000000000010111= 1,343,511, discarding the low bit
These bits as a double1.32756526 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,687,022 to the power 27,220,087,228,484
2,687,022 to the power 319,400,533,224,855,534,648
2,687,022 to the power 452,129,659,586,917,768,420,938,256
2,687,022 to the power 5140,073,542,162,558,955,937,966,354,513,632
First ten multiples2,687,022, 5,374,044, 8,061,066, 10,748,088, 13,435,110, 16,122,132, 18,809,154, 21,496,176, 24,183,198, 26,870,220
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 6
Divisible by 100No, remainder 22
Collatz (3n + 1) trajectory
Steps to reach 194the total stopping time
Highest value reached9,068,7043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,687,022 → 1,343,511 → 4,030,534 → 2,015,267 → 6,045,802 → 3,022,901 → 9,068,704 → 4,534,352 → 2,267,176 → 1,133,588 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage268,702,200%
2,687,022% as a decimal26,870.22
2,687,022% of 1002,687,022
2,687,022% of 1,00026,870,220
As a fraction of 1002,687,022/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,687,022
Nerdulate something else
Nothing in mind? Surprise me · today’s page