Recognised as Number
2,126,601
- Positive
- Odd
- Composite
- 7 digits
2,126,601 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,126,601
Digit count7
Digit sum18
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 79 × 997
Distinct prime factors33, 79, 997
Number of divisors16
Sum of divisors σ(n)3,193,600
Aliquot sum1,066,999sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,398,384integers below n that share no factor with it
Carmichael function λ(n)38,844the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,398,384
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 79, 237, 711, 997, 2,133, 2,991, 8,973, 26,919, 78,763, 236,289, 708,867, 2,126,60116 in total
Arithmetic
Previous number2,126,600
Next number2,126,602
Double4,253,202
Half1,063,300.5
Square4,522,431,813,201
Cube9,617,408,016,385,059,801
Square root1,458.287008788≈irrational, shown to 9 decimal places
Cube root128.596358658≈
Negation-2,126,601
Reciprocal4.70233955 × 10^-7≈
Representations
Decimal2,126,601
Binary100000011100110000100122 bits
Octal10071411
Hexadecimal207309
Base 3619KW9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and twenty-six thousand, six hundred and one
Ordinaltwo million, one hundred and twenty-six thousand, six hundred and first
Scientific notation2.126601 × 10^6
Engineering notation2.126601 × 10^6
In other bases
Ternary11000001011000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1021022401base 5; one hand: 10 digits
Septenary24035001base 7: 8 digits
Nonary4001130base 9; each digit is two ternary digits: 7 digits
Duodecimal866809base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald5ga1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:50:43:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11000001011000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011011011100011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000111001100001001
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
Bytes320 73 09
Gray code1100000100101010001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000111001100001001
64-bit0000000000000000000000000000000000000000001000000111001100001001
One's complement11111111110111111000110011110110at 32 bits, every bit flipped
Bits reversed10010000110011100000010000000000at 32 bits
Rotated left by 100000000010000001110011000010010at 32 bits, wrapping
Shifted left by 110000001110011000010010= 4,253,202, no wrap
Shifted right by 1100000011100110000100= 1,063,300, discarding the low bit
These bits as a double1.0506805 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,126,601 to the power 24,522,431,813,201
2,126,601 to the power 39,617,408,016,385,059,801
2,126,601 to the power 420,452,389,505,052,484,557,866,401
2,126,601 to the power 543,494,071,973,834,118,713,243,246,233,001
First ten multiples2,126,601, 4,253,202, 6,379,803, 8,506,404, 10,633,005, 12,759,606, 14,886,207, 17,012,808, 19,139,409, 21,266,010
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1104the total stopping time
Highest value reached10,765,9245× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,126,601 → 6,379,804 → 3,189,902 → 1,594,951 → 4,784,854 → 2,392,427 → 7,177,282 → 3,588,641 → 10,765,924 → 5,382,962 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage212,660,100%
2,126,601% as a decimal21,266.01
2,126,601% of 1002,126,601
2,126,601% of 1,00021,266,010
As a fraction of 1002,126,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,126,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page