Recognised as Number
2,098,601
- Positive
- Odd
- Composite
- 7 digits
2,098,601 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,098,601
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation769 × 2,729
Distinct prime factors2769, 2,729
Number of divisors4
Sum of divisors σ(n)2,102,100
Aliquot sum3,499sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,095,104integers below n that share no factor with it
Carmichael function λ(n)261,888the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,095,104
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 769, 2,729, 2,098,6014 in total
Arithmetic
Previous number2,098,600
Next number2,098,602
Double4,197,202
Half1,049,300.5
Square4,404,126,157,201
Cube9,242,503,557,628,175,801
Square root1,448.654893341≈irrational, shown to 9 decimal places
Cube root128.029473193≈
Negation-2,098,601
Reciprocal4.76507921 × 10^-7≈
Representations
Decimal2,098,601
Binary100000000001011010100122 bits
Octal10002651
Hexadecimal2005A9
Base 3618ZAH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, ninety-eight thousand, six hundred and one
Ordinaltwo million, ninety-eight thousand, six hundred and first
Scientific notation2.098601 × 10^6
Engineering notation2.098601 × 10^6
In other bases
Ternary10221121201222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1014123401base 5; one hand: 10 digits
Septenary23560241base 7: 8 digits
Nonary3847658base 9; each digit is two ternary digits: 7 digits
Duodecimal852575base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald26a1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:42:56:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100TT0TT1T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000001101011111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000000010110101001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes320 05 a9
Gray code1100000000011101111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000000010110101001
64-bit0000000000000000000000000000000000000000001000000000010110101001
One's complement11111111110111111111101001010110at 32 bits, every bit flipped
Bits reversed10010101101000000000010000000000at 32 bits
Rotated left by 100000000010000000000101101010010at 32 bits, wrapping
Shifted left by 110000000000101101010010= 4,197,202, no wrap
Shifted right by 1100000000001011010100= 1,049,300, discarding the low bit
These bits as a double1.03684666 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,098,601 to the power 24,404,126,157,201
2,098,601 to the power 39,242,503,557,628,175,801
2,098,601 to the power 419,396,327,208,542,047,364,154,401
2,098,601 to the power 540,705,151,676,173,549,140,461,790,093,001
First ten multiples2,098,601, 4,197,202, 6,295,803, 8,394,404, 10,493,005, 12,591,606, 14,690,207, 16,788,808, 18,887,409, 20,986,010
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 178the total stopping time
Highest value reached35,856,59217× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,098,601 → 6,295,804 → 3,147,902 → 1,573,951 → 4,721,854 → 2,360,927 → 7,082,782 → 3,541,391 → 10,624,174 → 5,312,087 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage209,860,100%
2,098,601% as a decimal20,986.01
2,098,601% of 1002,098,601
2,098,601% of 1,00020,986,010
As a fraction of 1002,098,601/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,098,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page