Recognised as Number
1,031,087
- Positive
- Odd
- Composite
- 7 digits
1,031,087 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 value1,031,087
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation653 × 1,579
Distinct prime factors2653, 1,579
Number of divisors4
Sum of divisors σ(n)1,033,320
Aliquot sum2,233sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,028,856integers below n that share no factor with it
Carmichael function λ(n)514,428the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,028,856
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 653, 1,579, 1,031,0874 in total
Arithmetic
Previous number1,031,086
Next number1,031,088
Double2,062,174
Half515,543.5
Square1,063,140,401,569
Cube1,096,190,247,232,575,503
Square root1,015.424541756≈irrational, shown to 9 decimal places
Cube root101.025677228≈
Negation-1,031,087
Reciprocal9.69850265 × 10^-7≈
Representations
Decimal1,031,087
Binary1111101110111010111120 bits
Octal3735657
HexadecimalFBBAF
Base 36M3LB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, thirty-one thousand and eighty-seven
Ordinalone million, thirty-one thousand and eighty-seventh
Scientific notation1.031087 × 10^6
Engineering notation1.031087 × 10^6
In other bases
Ternary1221101101102base 3; the most digit-efficient integer base after e: 13 digits
Quinary230443322base 5; one hand: 9 digits
Septenary11523041base 7: 8 digits
Nonary1841342base 9; each digit is two ternary digits: 7 digits
Duodecimal41883bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal68he7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:46:24:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T110110111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001100110011110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111011101110101111
Bit length20 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits4within that length
Bit parityeven16 set bits, so even; not the same as the number itself being odd
Highest set bitbit 19worth 524,288
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes30f bb af
Gray code10000110011001111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111011101110101111
64-bit0000000000000000000000000000000000000000000011111011101110101111
One's complement11111111111100000100010001010000at 32 bits, every bit flipped
Bits reversed11110101110111011111000000000000at 32 bits
Rotated left by 100000000000111110111011101011110at 32 bits, wrapping
Shifted left by 1111110111011101011110= 2,062,174, no wrap
Shifted right by 11111101110111010111= 515,543, discarding the low bit
These bits as a double5.09424665 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,031,087 to the power 21,063,140,401,569
1,031,087 to the power 31,096,190,247,232,575,503
1,031,087 to the power 41,130,267,513,448,294,577,661,761
1,031,087 to the power 51,165,404,139,638,861,711,197,532,164,207
First ten multiples1,031,087, 2,062,174, 3,093,261, 4,124,348, 5,155,435, 6,186,522, 7,217,609, 8,248,696, 9,279,783, 10,310,870
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
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 1
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 87
Collatz (3n + 1) trajectory
Steps to reach 1152the total stopping time
Highest value reached10,439,76410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,031,087 → 3,093,262 → 1,546,631 → 4,639,894 → 2,319,947 → 6,959,842 → 3,479,921 → 10,439,764 → 5,219,882 → 2,609,941 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage103,108,700%
1,031,087% as a decimal10,310.87
1,031,087% of 1001,031,087
1,031,087% of 1,00010,310,870
As a fraction of 1001,031,087/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,031,087
Nerdulate something else
Nothing in mind? Surprise me · today’s page