Recognised as Number
1,982,163
- Positive
- Odd
- Composite
- 7 digits
1,982,163 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,982,163
Digit count7
Digit sum30
Digit product2,592
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 23^2 × 1,249
Distinct prime factors33, 23, 1,249
Number of divisors12
Sum of divisors σ(n)2,765,000
Aliquot sum782,837sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,262,976integers below n that share no factor with it
Carmichael function λ(n)315,744the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,262,976
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 23, 69, 529, 1,249, 1,587, 3,747, 28,727, 86,181, 660,721, 1,982,16312 in total
Arithmetic
Previous number1,982,162
Next number1,982,164
Double3,964,326
Half991,081.5
Square3,928,970,158,569
Cube7,787,859,276,419,604,747
Square root1,407.893106738≈irrational, shown to 9 decimal places
Cube root125.616432425≈
Negation-1,982,163
Reciprocal5.04499378 × 10^-7≈
Representations
Decimal1,982,163
Binary11110001111101101001121 bits
Octal7437323
Hexadecimal1E3ED3
Base 3616HG3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and eighty-two thousand, one hundred and sixty-three
Ordinalone million, nine hundred and eighty-two thousand, one hundred and sixty-third
Scientific notation1.982163 × 10^6
Engineering notation1.982163 × 10^6
In other bases
Ternary10201201000110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1001412123base 5; one hand: 10 digits
Septenary22563621base 7: 8 digits
Nonary3651013base 9; each digit is two ternary digits: 7 digits
Duodecimal7b7103base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc7f83base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:10:36:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1TT01000110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100100001111010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100011111011010011
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31e 3e d3
Gray code100010010000110111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100011111011010011
64-bit0000000000000000000000000000000000000000000111100011111011010011
One's complement11111111111000011100000100101100at 32 bits, every bit flipped
Bits reversed11001011011111000111100000000000at 32 bits
Rotated left by 100000000001111000111110110100110at 32 bits, wrapping
Shifted left by 11111000111110110100110= 3,964,326, no wrap
Shifted right by 111110001111101101001= 991,081, discarding the low bit
These bits as a double9.79318643 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,982,163 to the power 23,928,970,158,569
1,982,163 to the power 37,787,859,276,419,604,747
1,982,163 to the power 415,436,806,506,925,713,004,127,761
1,982,163 to the power 530,598,266,696,187,392,065,400,895,127,043
First ten multiples1,982,163, 3,964,326, 5,946,489, 7,928,652, 9,910,815, 11,892,978, 13,875,141, 15,857,304, 17,839,467, 19,821,630
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1171the total stopping time
Highest value reached8,919,7364× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,982,163 → 5,946,490 → 2,973,245 → 8,919,736 → 4,459,868 → 2,229,934 → 1,114,967 → 3,344,902 → 1,672,451 → 5,017,354 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage198,216,300%
1,982,163% as a decimal19,821.63
1,982,163% of 1001,982,163
1,982,163% of 1,00019,821,630
As a fraction of 1001,982,163/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,163
Nerdulate something else
Nothing in mind? Surprise me · today’s page