Recognised as Number
1,982,968
- Positive
- Even
- Composite
- 7 digits
1,982,968 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,982,968
Digit count7
Digit sum43
Digit product62,208
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 13 × 23 × 829
Distinct prime factors42, 13, 23, 829
Number of divisors32
Sum of divisors σ(n)4,183,200
Aliquot sum2,200,232sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)874,368integers below n that share no factor with it
Carmichael function λ(n)9,108the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 874,368
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 13, 23, 26, 46, 52, 92, 104, 184, 299, 598, 829, 1,196, 1,658, 2,392, 3,316, 6,632, 10,777, 19,067, 21,554, 38,134, 43,108, 76,268, 86,216, 152,536, 247,871, 495,742, 991,484, 1,982,96832 in total
Arithmetic
Previous number1,982,967
Next number1,982,969
Double3,965,936
Half991,484
Square3,932,162,089,024
Cube7,797,351,593,347,743,232
Square root1,408.178965899≈irrational, shown to 9 decimal places
Cube root125.633435322≈
Negation-1,982,968
Reciprocal5.04294573 × 10^-7≈
Representations
Decimal1,982,968
Binary11110010000011111100021 bits
Octal7440770
Hexadecimal1E41F8
Base 3616I2G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and eighty-two thousand, nine hundred and sixty-eight
Ordinalone million, nine hundred and eighty-two thousand, nine hundred and sixty-eighth
Scientific notation1.982968 × 10^6
Engineering notation1.982968 × 10^6
In other bases
Ternary10201202010021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1001423333base 5; one hand: 10 digits
Septenary22566151base 7: 8 digits
Nonary3652107base 9; each digit is two ternary digits: 7 digits
Duodecimal7b7674base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc7h88base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:10:49:28base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1TT1T0101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100100011000001000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111100100000111111000
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes31e 41 f8
Gray code100010110000100000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111100100000111111000
64-bit0000000000000000000000000000000000000000000111100100000111111000
One's complement11111111111000011011111000000111at 32 bits, every bit flipped
Bits reversed00011111100000100111100000000000at 32 bits
Rotated left by 100000000001111001000001111110000at 32 bits, wrapping
Shifted left by 11111001000001111110000= 3,965,936, no wrap
Shifted right by 111110010000011111100= 991,484, discarding the low bit
These bits as a double9.79716366 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,982,968 to the power 23,932,162,089,024
1,982,968 to the power 37,797,351,593,347,743,232
1,982,968 to the power 415,461,898,694,357,587,701,272,576
1,982,968 to the power 530,660,450,330,152,876,968,817,077,485,568
First ten multiples1,982,968, 3,965,936, 5,948,904, 7,931,872, 9,914,840, 11,897,808, 13,880,776, 15,863,744, 17,846,712, 19,829,680
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 68
Collatz (3n + 1) trajectory
Steps to reach 196the total stopping time
Highest value reached9,045,1604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,982,968 → 991,484 → 495,742 → 247,871 → 743,614 → 371,807 → 1,115,422 → 557,711 → 1,673,134 → 836,567 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage198,296,800%
1,982,968% as a decimal19,829.68
1,982,968% of 1001,982,968
1,982,968% of 1,00019,829,680
As a fraction of 1001,982,968/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,968
Nerdulate something else
Nothing in mind? Surprise me · today’s page