Recognised as Number
1,986,731
- Positive
- Odd
- Composite
- 7 digits
1,986,731 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,986,731
Digit count7
Digit sum35
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,373 × 1,447
Distinct prime factors21,373, 1,447
Number of divisors4
Sum of divisors σ(n)1,989,552
Aliquot sum2,821sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,983,912integers below n that share no factor with it
Carmichael function λ(n)991,956the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,983,912
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,373, 1,447, 1,986,7314 in total
Arithmetic
Previous number1,986,730
Next number1,986,732
Double3,973,462
Half993,365.5
Square3,947,100,066,361
Cube7,841,826,061,941,455,891
Square root1,409.514455407≈irrational, shown to 9 decimal places
Cube root125.712854974≈
Negation-1,986,731
Reciprocal5.03339405 × 10^-7≈
Representations
Decimal1,986,731
Binary11110010100001010101121 bits
Octal7450253
Hexadecimal1E50AB
Base 3616KYZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and eighty-six thousand, seven hundred and thirty-one
Ordinalone million, nine hundred and eighty-six thousand, seven hundred and thirty-first
Scientific notation1.986731 × 10^6
Engineering notation1.986731 × 10^6
In other bases
Ternary10201221021122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1002033411base 5; one hand: 10 digits
Septenary22613135base 7: 8 digits
Nonary3657248base 9; each digit is two ternary digits: 7 digits
Duodecimal7b988bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc86gbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:11:52:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1T0T110TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100101000111111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100101000010101011
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; 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 50 ab
Gray code100010111100011111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100101000010101011
64-bit0000000000000000000000000000000000000000000111100101000010101011
One's complement11111111111000011010111101010100at 32 bits, every bit flipped
Bits reversed11010101000010100111100000000000at 32 bits
Rotated left by 100000000001111001010000101010110at 32 bits, wrapping
Shifted left by 11111001010000101010110= 3,973,462, no wrap
Shifted right by 111110010100001010101= 993,365, discarding the low bit
These bits as a double9.81575535 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,986,731 to the power 23,947,100,066,361
1,986,731 to the power 37,841,826,061,941,455,891
1,986,731 to the power 415,579,598,933,867,010,603,782,321
1,986,731 to the power 530,952,472,169,480,539,843,863,054,382,651
First ten multiples1,986,731, 3,973,462, 5,960,193, 7,946,924, 9,933,655, 11,920,386, 13,907,117, 15,893,848, 17,880,579, 19,867,310
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1122the total stopping time
Highest value reached8,940,2924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,986,731 → 5,960,194 → 2,980,097 → 8,940,292 → 4,470,146 → 2,235,073 → 6,705,220 → 3,352,610 → 1,676,305 → 5,028,916 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage198,673,100%
1,986,731% as a decimal19,867.31
1,986,731% of 1001,986,731
1,986,731% of 1,00019,867,310
As a fraction of 1001,986,731/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,986,731
Nerdulate something else
Nothing in mind? Surprise me · today’s page