Recognised as Number
1,961,990
- Positive
- Even
- Composite
- 7 digits
1,961,990 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,961,990
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 5 × 31 × 6,329
Distinct prime factors42, 5, 31, 6,329
Number of divisors16
Sum of divisors σ(n)3,646,080
Aliquot sum1,684,090sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)759,360integers below n that share no factor with it
Carmichael function λ(n)94,920the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 759,360
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 31, 62, 155, 310, 6,329, 12,658, 31,645, 63,290, 196,199, 392,398, 980,995, 1,961,99016 in total
Arithmetic
Previous number1,961,989
Next number1,961,991
Double3,923,980
Half980,995
Square3,849,404,760,100
Cube7,552,493,645,268,599,000
Square root1,400.710533979≈irrational, shown to 9 decimal places
Cube root125.188834588≈
Negation-1,961,990
Reciprocal5.09686594 × 10^-7≈
Representations
Decimal1,961,990
Binary11101111100000000011021 bits
Octal7370006
Hexadecimal1DF006
Base 36161VQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and sixty-one thousand, nine hundred and ninety
Ordinalone million, nine hundred and sixty-one thousand, nine hundred and ninetieth
Scientific notation1.96199 × 10^6
Engineering notation1.96199 × 10^6
In other bases
Ternary10200200100022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1000240430base 5; one hand: 10 digits
Septenary22451042base 7: 8 digits
Nonary3620308base 9; each digit is two ternary digits: 7 digits
Duodecimal7a74b2base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc54jabase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:4:59:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T01T0010010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100011000000011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111011111000000000110
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes31d f0 06
Gray code100110000100000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111011111000000000110
64-bit0000000000000000000000000000000000000000000111011111000000000110
One's complement11111111111000100000111111111001at 32 bits, every bit flipped
Bits reversed01100000000011111011100000000000at 32 bits
Rotated left by 100000000001110111110000000001100at 32 bits, wrapping
Shifted left by 11110111110000000001100= 3,923,980, no wrap
Shifted right by 111101111100000000011= 980,995, discarding the low bit
These bits as a double9.69351856 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,961,990 to the power 23,849,404,760,100
1,961,990 to the power 37,552,493,645,268,599,000
1,961,990 to the power 414,817,917,007,080,538,552,010,000
1,961,990 to the power 529,072,604,988,721,945,833,658,099,900,000
First ten multiples1,961,990, 3,923,980, 5,885,970, 7,847,960, 9,809,950, 11,771,940, 13,733,930, 15,695,920, 17,657,910, 19,619,900
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 196the total stopping time
Highest value reached4,414,4802× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,961,990 → 980,995 → 2,942,986 → 1,471,493 → 4,414,480 → 2,207,240 → 1,103,620 → 551,810 → 275,905 → 827,716 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage196,199,000%
1,961,990% as a decimal19,619.9
1,961,990% of 1001,961,990
1,961,990% of 1,00019,619,900
As a fraction of 1001,961,990/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,961,990
Nerdulate something else
Nothing in mind? Surprise me · today’s page