Recognised as Number
2,126,587
- Positive
- Odd
- Prime
- 7 digits
2,126,587 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,126,587
Digit count7
Digit sum31
Digit product6,720
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,126,587
Distinct prime factors12,126,587
Number of divisors2
Sum of divisors σ(n)2,126,588
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,126,586integers below n that share no factor with it
Carmichael function λ(n)2,126,586the 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,126,5872 in total
Arithmetic
Previous number2,126,586
Next number2,126,588
Double4,253,174
Half1,063,293.5
Square4,522,372,268,569
Cube9,617,218,075,499,344,003
Square root1,458.282208628≈irrational, shown to 9 decimal places
Cube root128.596076462≈
Negation-2,126,587
Reciprocal4.70237051 × 10^-7≈
Representations
Decimal2,126,587
Binary100000011100101111101122 bits
Octal10071373
Hexadecimal2072FB
Base 3619KVV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and twenty-six thousand, five hundred and eighty-seven
Ordinaltwo million, one hundred and twenty-six thousand, five hundred and eighty-seventh
Scientific notation2.126587 × 10^6
Engineering notation2.126587 × 10^6
In other bases
Ternary11000001010111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1021022322base 5; one hand: 10 digits
Septenary24034651base 7: 8 digits
Nonary4001114base 9; each digit is two ternary digits: 7 digits
Duodecimal8667b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald5g97base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:50:43:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11000001010111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011011011100001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000111001011111011
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes320 72 fb
Gray code1100000100101110000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000111001011111011
64-bit0000000000000000000000000000000000000000001000000111001011111011
One's complement11111111110111111000110100000100at 32 bits, every bit flipped
Bits reversed11011111010011100000010000000000at 32 bits
Rotated left by 100000000010000001110010111110110at 32 bits, wrapping
Shifted left by 110000001110010111110110= 4,253,174, no wrap
Shifted right by 1100000011100101111101= 1,063,293, discarding the low bit
These bits as a double1.05067358 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,126,587 to the power 24,522,372,268,569
2,126,587 to the power 39,617,218,075,499,344,003
2,126,587 to the power 420,451,850,935,521,923,465,307,761
2,126,587 to the power 543,492,640,325,418,760,656,318,435,541,707
First ten multiples2,126,587, 4,253,174, 6,379,761, 8,506,348, 10,632,935, 12,759,522, 14,886,109, 17,012,696, 19,139,283, 21,265,870
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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1104the total stopping time
Highest value reached18,167,3808× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,126,587 → 6,379,762 → 3,189,881 → 9,569,644 → 4,784,822 → 2,392,411 → 7,177,234 → 3,588,617 → 10,765,852 → 5,382,926 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage212,658,700%
2,126,587% as a decimal21,265.87
2,126,587% of 1002,126,587
2,126,587% of 1,00021,265,870
As a fraction of 1002,126,587/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,126,587
Nerdulate something else
Nothing in mind? Surprise me · today’s page