Recognised as Number
1,982,963
- Positive
- Odd
- Composite
- 7 digits
1,982,963 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,982,963
Digit count7
Digit sum38
Digit product23,328
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation439 × 4,517
Distinct prime factors2439, 4,517
Number of divisors4
Sum of divisors σ(n)1,987,920
Aliquot sum4,957sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,978,008integers below n that share no factor with it
Carmichael function λ(n)989,004the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,978,008
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 439, 4,517, 1,982,9634 in total
Arithmetic
Previous number1,982,962
Next number1,982,964
Double3,965,926
Half991,481.5
Square3,932,142,259,369
Cube7,797,292,611,065,130,347
Square root1,408.177190555≈irrational, shown to 9 decimal places
Cube root125.633329728≈
Negation-1,982,963
Reciprocal5.04295844 × 10^-7≈
Representations
Decimal1,982,963
Binary11110010000011111001121 bits
Octal7440763
Hexadecimal1E41F3
Base 3616I2B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and eighty-two thousand, nine hundred and sixty-three
Ordinalone million, nine hundred and eighty-two thousand, nine hundred and sixty-third
Scientific notation1.982963 × 10^6
Engineering notation1.982963 × 10^6
In other bases
Ternary10201202010002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1001423323base 5; one hand: 10 digits
Septenary22566143base 7: 8 digits
Nonary3652102base 9; each digit is two ternary digits: 7 digits
Duodecimal7b766bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc7h83base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:10:49:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1TT1T01001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100100011000110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100100000111110011
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31e 41 f3
Gray code100010110000100001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100100000111110011
64-bit0000000000000000000000000000000000000000000111100100000111110011
One's complement11111111111000011011111000001100at 32 bits, every bit flipped
Bits reversed11001111100000100111100000000000at 32 bits
Rotated left by 100000000001111001000001111100110at 32 bits, wrapping
Shifted left by 11111001000001111100110= 3,965,926, no wrap
Shifted right by 111110010000011111001= 991,481, discarding the low bit
These bits as a double9.79713895 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,982,963 to the power 23,932,142,259,369
1,982,963 to the power 37,797,292,611,065,130,347
1,982,963 to the power 415,461,742,747,915,544,068,278,161
1,982,963 to the power 530,660,063,784,634,851,012,265,066,971,043
First ten multiples1,982,963, 3,965,926, 5,948,889, 7,931,852, 9,914,815, 11,897,778, 13,880,741, 15,863,704, 17,846,667, 19,829,630
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1122the total stopping time
Highest value reached8,923,3364× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,982,963 → 5,948,890 → 2,974,445 → 8,923,336 → 4,461,668 → 2,230,834 → 1,115,417 → 3,346,252 → 1,673,126 → 836,563 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage198,296,300%
1,982,963% as a decimal19,829.63
1,982,963% of 1001,982,963
1,982,963% of 1,00019,829,630
As a fraction of 1001,982,963/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,963
Nerdulate something else
Nothing in mind? Surprise me · today’s page