Recognised as Number
2,132,987
- Positive
- Odd
- Composite
- 7 digits
2,132,987 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,132,987
Digit count7
Digit sum32
Digit product6,048
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation61 × 73 × 479
Distinct prime factors361, 73, 479
Number of divisors8
Sum of divisors σ(n)2,202,240
Aliquot sum69,253sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,064,960integers below n that share no factor with it
Carmichael function λ(n)86,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,064,960
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 61, 73, 479, 4,453, 29,219, 34,967, 2,132,9878 in total
Arithmetic
Previous number2,132,986
Next number2,132,988
Double4,265,974
Half1,066,493.5
Square4,549,633,542,169
Cube9,704,309,200,210,428,803
Square root1,460.474922756≈irrational, shown to 9 decimal places
Cube root128.724951296≈
Negation-2,132,987
Reciprocal4.68826111 × 10^-7≈
Representations
Decimal2,132,987
Binary100000100010111111101122 bits
Octal10105773
Hexadecimal208BFB
Base 3619PTN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and thirty-two thousand, nine hundred and eighty-seven
Ordinaltwo million, one hundred and thirty-two thousand, nine hundred and eighty-seventh
Scientific notation2.132987 × 10^6
Engineering notation2.132987 × 10^6
In other bases
Ternary11000100220112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1021223422base 5; one hand: 10 digits
Septenary24062423base 7: 8 digits
Nonary4010815base 9; each digit is two ternary digits: 7 digits
Duodecimal86a44bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald6c97base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:52:29:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110001010T1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011001110000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000001000101111111011
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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 8b fb
Gray code1100001100111000000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000001000101111111011
64-bit0000000000000000000000000000000000000000001000001000101111111011
One's complement11111111110111110111010000000100at 32 bits, every bit flipped
Bits reversed11011111110100010000010000000000at 32 bits
Rotated left by 100000000010000010001011111110110at 32 bits, wrapping
Shifted left by 110000010001011111110110= 4,265,974, no wrap
Shifted right by 1100000100010111111101= 1,066,493, discarding the low bit
These bits as a double1.0538356 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,132,987 to the power 24,549,633,542,169
2,132,987 to the power 39,704,309,200,210,428,803
2,132,987 to the power 420,699,165,368,029,241,901,224,561
2,132,987 to the power 544,151,050,640,856,588,595,167,272,693,707
First ten multiples2,132,987, 4,265,974, 6,398,961, 8,531,948, 10,664,935, 12,797,922, 14,930,909, 17,063,896, 19,196,883, 21,329,870
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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 196the total stopping time
Highest value reached12,148,0365× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,132,987 → 6,398,962 → 3,199,481 → 9,598,444 → 4,799,222 → 2,399,611 → 7,198,834 → 3,599,417 → 10,798,252 → 5,399,126 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage213,298,700%
2,132,987% as a decimal21,329.87
2,132,987% of 1002,132,987
2,132,987% of 1,00021,329,870
As a fraction of 1002,132,987/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,132,987
Nerdulate something else
Nothing in mind? Surprise me · today’s page