Recognised as Number
2,125,822
- Positive
- Even
- Composite
- 7 digits
2,125,822 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,125,822
Digit count7
Digit sum22
Digit product640
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 × 1,062,911
Distinct prime factors22, 1,062,911
Number of divisors4
Sum of divisors σ(n)3,188,736
Aliquot sum1,062,914sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,062,910integers below n that share no factor with it
Carmichael function λ(n)1,062,910the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,062,911, 2,125,8224 in total
Arithmetic
Previous number2,125,821
Next number2,125,823
Double4,251,644
Half1,062,911
Square4,519,119,175,684
Cube9,606,842,964,290,912,248
Square root1,458.019890125≈irrational, shown to 9 decimal places
Cube root128.5806546≈
Negation-2,125,822
Reciprocal4.70406271 × 10^-7≈
Representations
Decimal2,125,822
Binary100000011011111111111022 bits
Octal10067776
Hexadecimal206FFE
Base 3619KAM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and twenty-five thousand, eight hundred and twenty-two
Ordinaltwo million, one hundred and twenty-five thousand, eight hundred and twenty-second
Scientific notation2.125822 × 10^6
Engineering notation2.125822 × 10^6
In other bases
Ternary11000000002011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1021011242base 5; one hand: 10 digits
Septenary24032506base 7: 8 digits
Nonary4000064base 9; each digit is two ternary digits: 7 digits
Duodecimal86627abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald5eb2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:50:30:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100000001T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011011000000000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000110111111111110
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; 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
Bytes320 6f fe
Gray code1100000101100000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000110111111111110
64-bit0000000000000000000000000000000000000000001000000110111111111110
One's complement11111111110111111001000000000001at 32 bits, every bit flipped
Bits reversed01111111111101100000010000000000at 32 bits
Rotated left by 100000000010000001101111111111100at 32 bits, wrapping
Shifted left by 110000001101111111111100= 4,251,644, no wrap
Shifted right by 1100000011011111111111= 1,062,911, discarding the low bit
These bits as a double1.05029562 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,125,822 to the power 24,519,119,175,684
2,125,822 to the power 39,606,842,964,290,912,248
2,125,822 to the power 420,422,438,124,034,835,656,867,856
2,125,822 to the power 543,414,468,257,711,982,405,754,139,377,632
First ten multiples2,125,822, 4,251,644, 6,377,466, 8,503,288, 10,629,110, 12,754,932, 14,880,754, 17,006,576, 19,132,398, 21,258,220
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 10
Divisible by 100No, remainder 22
Collatz (3n + 1) trajectory
Steps to reach 1347the total stopping time
Highest value reached183,878,58486× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,125,822 → 1,062,911 → 3,188,734 → 1,594,367 → 4,783,102 → 2,391,551 → 7,174,654 → 3,587,327 → 10,761,982 → 5,380,991 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage212,582,200%
2,125,822% as a decimal21,258.22
2,125,822% of 1002,125,822
2,125,822% of 1,00021,258,220
As a fraction of 1002,125,822/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,125,822
Nerdulate something else
Nothing in mind? Surprise me · today’s page