Recognised as Number
1,961,991
- Positive
- Odd
- Composite
- 7 digits
1,961,991 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,961,991
Digit count7
Digit sum36
Digit product4,374
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 277 × 787
Distinct prime factors33, 277, 787
Number of divisors12
Sum of divisors σ(n)2,847,832
Aliquot sum885,841sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,301,616integers below n that share no factor with it
Carmichael function λ(n)36,156the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,301,616
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 277, 787, 831, 2,361, 2,493, 7,083, 217,999, 653,997, 1,961,99112 in total
Arithmetic
Previous number1,961,990
Next number1,961,992
Double3,923,982
Half980,995.5
Square3,849,408,684,081
Cube7,552,505,193,488,765,271
Square root1,400.710890941≈irrational, shown to 9 decimal places
Cube root125.188855857≈
Negation-1,961,991
Reciprocal5.09686334 × 10^-7≈
Representations
Decimal1,961,991
Binary11101111100000000011121 bits
Octal7370007
Hexadecimal1DF007
Base 36161VR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and sixty-one thousand, nine hundred and ninety-one
Ordinalone million, nine hundred and sixty-one thousand, nine hundred and ninety-first
Scientific notation1.961991 × 10^6
Engineering notation1.961991 × 10^6
In other bases
Ternary10200200100100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1000240431base 5; one hand: 10 digits
Septenary22451043base 7: 8 digits
Nonary3620310base 9; each digit is two ternary digits: 7 digits
Duodecimal7a74b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc54jbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:4:59:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T01T00100100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100011000000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111011111000000000111
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
Bytes31d f0 07
Gray code100110000100000000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111011111000000000111
64-bit0000000000000000000000000000000000000000000111011111000000000111
One's complement11111111111000100000111111111000at 32 bits, every bit flipped
Bits reversed11100000000011111011100000000000at 32 bits
Rotated left by 100000000001110111110000000001110at 32 bits, wrapping
Shifted left by 11110111110000000001110= 3,923,982, no wrap
Shifted right by 111101111100000000011= 980,995, discarding the low bit
These bits as a double9.69352351 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,961,991 to the power 23,849,408,684,081
1,961,991 to the power 37,552,505,193,488,765,271
1,961,991 to the power 414,817,947,217,078,216,062,814,561
1,961,991 to the power 529,072,679,078,382,506,211,297,603,350,951
First ten multiples1,961,991, 3,923,982, 5,885,973, 7,847,964, 9,809,955, 11,771,946, 13,733,937, 15,695,928, 17,657,919, 19,619,910
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1153the total stopping time
Highest value reached13,243,4446× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,961,991 → 5,885,974 → 2,942,987 → 8,828,962 → 4,414,481 → 13,243,444 → 6,621,722 → 3,310,861 → 9,932,584 → 4,966,292 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage196,199,100%
1,961,991% as a decimal19,619.91
1,961,991% of 1001,961,991
1,961,991% of 1,00019,619,910
As a fraction of 1001,961,991/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,991
Nerdulate something else
Nothing in mind? Surprise me · today’s page