Recognised as Number
1,982,966
- Positive
- Even
- Composite
- 7 digits
1,982,966 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,982,966
Digit count7
Digit sum41
Digit product46,656
Multiplicative persistence3times 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 × 991,483
Distinct prime factors22, 991,483
Number of divisors4
Sum of divisors σ(n)2,974,452
Aliquot sum991,486sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)991,482integers below n that share no factor with it
Carmichael function λ(n)991,482the 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, 991,483, 1,982,9664 in total
Arithmetic
Previous number1,982,965
Next number1,982,967
Double3,965,932
Half991,483
Square3,932,154,157,156
Cube7,797,328,000,399,004,696
Square root1,408.178255762≈irrational, shown to 9 decimal places
Cube root125.633393085≈
Negation-1,982,966
Reciprocal5.04295081 × 10^-7≈
Representations
Decimal1,982,966
Binary11110010000011111011021 bits
Octal7440766
Hexadecimal1E41F6
Base 3616I2E
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and eighty-two thousand, nine hundred and sixty-six
Ordinalone million, nine hundred and eighty-two thousand, nine hundred and sixty-sixth
Scientific notation1.982966 × 10^6
Engineering notation1.982966 × 10^6
In other bases
Ternary10201202010012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1001423331base 5; one hand: 10 digits
Septenary22566146base 7: 8 digits
Nonary3652105base 9; each digit is two ternary digits: 7 digits
Duodecimal7b7672base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc7h86base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:10:49:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1TT1T0101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100100011000001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100100000111110110
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes31e 41 f6
Gray code100010110000100001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100100000111110110
64-bit0000000000000000000000000000000000000000000111100100000111110110
One's complement11111111111000011011111000001001at 32 bits, every bit flipped
Bits reversed01101111100000100111100000000000at 32 bits
Rotated left by 100000000001111001000001111101100at 32 bits, wrapping
Shifted left by 11111001000001111101100= 3,965,932, no wrap
Shifted right by 111110010000011111011= 991,483, discarding the low bit
These bits as a double9.79715377 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,982,966 to the power 23,932,154,157,156
1,982,966 to the power 37,797,328,000,399,004,696
1,982,966 to the power 415,461,836,315,639,212,746,008,336
1,982,966 to the power 530,660,295,711,477,827,142,101,166,004,576
First ten multiples1,982,966, 3,965,932, 5,948,898, 7,931,864, 9,914,830, 11,897,796, 13,880,762, 15,863,728, 17,846,694, 19,829,660
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10No, remainder 6
Divisible by 11No, remainder 7
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1215the total stopping time
Highest value reached366,326,872184× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,982,966 → 991,483 → 2,974,450 → 1,487,225 → 4,461,676 → 2,230,838 → 1,115,419 → 3,346,258 → 1,673,129 → 5,019,388 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage198,296,600%
1,982,966% as a decimal19,829.66
1,982,966% of 1001,982,966
1,982,966% of 1,00019,829,660
As a fraction of 1001,982,966/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 1,982,966
Nerdulate something else
Nothing in mind? Surprise me · today’s page