Recognised as Number
2,131,967
- Positive
- Odd
- Composite
- 7 digits
2,131,967 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,131,967
Digit count7
Digit sum29
Digit product2,268
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation47 × 45,361
Distinct prime factors247, 45,361
Number of divisors4
Sum of divisors σ(n)2,177,376
Aliquot sum45,409sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,086,560integers below n that share no factor with it
Carmichael function λ(n)1,043,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,086,560
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 47, 45,361, 2,131,9674 in total
Arithmetic
Previous number2,131,966
Next number2,131,968
Double4,263,934
Half1,065,983.5
Square4,545,283,289,089
Cube9,690,393,977,989,208,063
Square root1,460.125679522≈irrational, shown to 9 decimal places
Cube root128.704429154≈
Negation-2,131,967
Reciprocal4.69050412 × 10^-7≈
Representations
Decimal2,131,967
Binary100000100001111111111122 bits
Octal10103777
Hexadecimal2087FF
Base 3619P1B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and thirty-one thousand, nine hundred and sixty-seven
Ordinaltwo million, one hundred and thirty-one thousand, nine hundred and sixty-seventh
Scientific notation2.131967 × 10^6
Engineering notation2.131967 × 10^6
In other bases
Ternary11000022111202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1021210332base 5; one hand: 10 digits
Septenary24056435base 7: 8 digits
Nonary4008452base 9; each digit is two ternary digits: 7 digits
Duodecimal86993bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald69i7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:52:12:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11000100TTTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011001100000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000001000011111111111
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes320 87 ff
Gray code1100001100010000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000001000011111111111
64-bit0000000000000000000000000000000000000000001000001000011111111111
One's complement11111111110111110111100000000000at 32 bits, every bit flipped
Bits reversed11111111111000010000010000000000at 32 bits
Rotated left by 100000000010000010000111111111110at 32 bits, wrapping
Shifted left by 110000010000111111111110= 4,263,934, no wrap
Shifted right by 1100000100001111111111= 1,065,983, discarding the low bit
These bits as a double1.05333165 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,131,967 to the power 24,545,283,289,089
2,131,967 to the power 39,690,393,977,989,208,063
2,131,967 to the power 420,659,600,178,071,717,946,449,921
2,131,967 to the power 544,045,585,812,843,026,295,138,998,724,607
First ten multiples2,131,967, 4,263,934, 6,395,901, 8,527,868, 10,659,835, 12,791,802, 14,923,769, 17,055,736, 19,187,703, 21,319,670
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1135the total stopping time
Highest value reached368,820,052172× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,131,967 → 6,395,902 → 3,197,951 → 9,593,854 → 4,796,927 → 14,390,782 → 7,195,391 → 21,586,174 → 10,793,087 → 32,379,262 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage213,196,700%
2,131,967% as a decimal21,319.67
2,131,967% of 1002,131,967
2,131,967% of 1,00021,319,670
As a fraction of 1002,131,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 2,131,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page