Recognised as Number
2,687,261
- Positive
- Odd
- Prime
- 7 digits
2,687,261 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,687,261
Digit count7
Digit sum32
Digit product8,064
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,687,261
Distinct prime factors12,687,261
Number of divisors2
Sum of divisors σ(n)2,687,262
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,687,260integers below n that share no factor with it
Carmichael function λ(n)2,687,260the 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,687,2612 in total
Arithmetic
Previous number2,687,260
Next number2,687,262
Double5,374,522
Half1,343,630.5
Square7,221,371,682,121
Cube19,405,710,487,868,160,581
Square root1,639.286735138≈irrational, shown to 9 decimal places
Cube root139.028322645≈
Negation-2,687,261
Reciprocal3.72126117 × 10^-7≈
Representations
Decimal2,687,261
Binary101001000000010001110122 bits
Octal12200435
Hexadecimal29011D
Base 361LLI5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and eighty-seven thousand, two hundred and sixty-one
Ordinaltwo million, six hundred and eighty-seven thousand, two hundred and sixty-first
Scientific notation2.687261 × 10^6
Engineering notation2.687261 × 10^6
In other bases
Ternary12001112020012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1141443021base 5; one hand: 10 digits
Septenary31561403base 7: 8 digits
Nonary5045205base 9; each digit is two ternary digits: 7 digits
Duodecimala97165base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgfi31base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:26:27:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT01TTTT1T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010000000101101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010000000100011101
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; 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
Bytes329 01 1d
Gray code1111011000000110010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010000000100011101
64-bit0000000000000000000000000000000000000000001010010000000100011101
One's complement11111111110101101111111011100010at 32 bits, every bit flipped
Bits reversed10111000100000001001010000000000at 32 bits
Rotated left by 100000000010100100000001000111010at 32 bits, wrapping
Shifted left by 110100100000001000111010= 5,374,522, no wrap
Shifted right by 1101001000000010001110= 1,343,630, discarding the low bit
These bits as a double1.32768334 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,687,261 to the power 27,221,371,682,121
2,687,261 to the power 319,405,710,487,868,160,581
2,687,261 to the power 452,148,208,971,339,081,071,058,641
2,687,261 to the power 5140,135,848,188,529,630,338,094,114,672,301
First ten multiples2,687,261, 5,374,522, 8,061,783, 10,749,044, 13,436,305, 16,123,566, 18,810,827, 21,498,088, 24,185,349, 26,872,610
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached8,061,7843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,687,261 → 8,061,784 → 4,030,892 → 2,015,446 → 1,007,723 → 3,023,170 → 1,511,585 → 4,534,756 → 2,267,378 → 1,133,689 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage268,726,100%
2,687,261% as a decimal26,872.61
2,687,261% of 1002,687,261
2,687,261% of 1,00026,872,610
As a fraction of 1002,687,261/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,261
Nerdulate something else
Nothing in mind? Surprise me · today’s page