Recognised as Number
1,983,967
- Positive
- Odd
- Prime
- 7 digits
1,983,967 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,983,967
Digit count7
Digit sum43
Digit product81,648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,983,967
Distinct prime factors11,983,967
Number of divisors2
Sum of divisors σ(n)1,983,968
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,983,966integers below n that share no factor with it
Carmichael function λ(n)1,983,966the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,983,9672 in total
Arithmetic
Previous number1,983,966
Next number1,983,968
Double3,967,934
Half991,983.5
Square3,936,125,057,089
Cube7,809,142,221,137,692,063
Square root1,408.533634671≈irrational, shown to 9 decimal places
Cube root125.654529415≈
Negation-1,983,967
Reciprocal5.04040642 × 10^-7≈
Representations
Decimal1,983,967
Binary11110010001011101111121 bits
Octal7442737
Hexadecimal1E45DF
Base 3616IU7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and eighty-three thousand, nine hundred and sixty-seven
Ordinalone million, nine hundred and eighty-three thousand, nine hundred and sixty-seventh
Scientific notation1.983967 × 10^6
Engineering notation1.983967 × 10^6
In other bases
Ternary10201210111021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1001441332base 5; one hand: 10 digits
Septenary22602106base 7: 8 digits
Nonary3653437base 9; each digit is two ternary digits: 7 digits
Duodecimal7b8167base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc7ji7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:11:6:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1TT101111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100101101000100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100100010111011111
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 45 df
Gray code100010110011100110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100100010111011111
64-bit0000000000000000000000000000000000000000000111100100010111011111
One's complement11111111111000011011101000100000at 32 bits, every bit flipped
Bits reversed11111011101000100111100000000000at 32 bits
Rotated left by 100000000001111001000101110111110at 32 bits, wrapping
Shifted left by 11111001000101110111110= 3,967,934, no wrap
Shifted right by 111110010001011101111= 991,983, discarding the low bit
These bits as a double9.80209937 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,983,967 to the power 23,936,125,057,089
1,983,967 to the power 37,809,142,221,137,692,063
1,983,967 to the power 415,493,080,465,043,883,509,153,921
1,983,967 to the power 530,737,760,370,991,718,434,005,577,184,607
First ten multiples1,983,967, 3,967,934, 5,951,901, 7,935,868, 9,919,835, 11,903,802, 13,887,769, 15,871,736, 17,855,703, 19,839,670
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1122the total stopping time
Highest value reached72,397,31236× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,983,967 → 5,951,902 → 2,975,951 → 8,927,854 → 4,463,927 → 13,391,782 → 6,695,891 → 20,087,674 → 10,043,837 → 30,131,512 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage198,396,700%
1,983,967% as a decimal19,839.67
1,983,967% of 1001,983,967
1,983,967% of 1,00019,839,670
As a fraction of 1001,983,967/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,983,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page