Recognised as Number
1,087,316
- Positive
- Even
- Composite
- 7 digits
1,087,316 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,087,316
Digit count7
Digit sum26
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^2 × 271,829
Distinct prime factors22, 271,829
Number of divisors6
Sum of divisors σ(n)1,902,810
Aliquot sum815,494sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)543,656integers below n that share no factor with it
Carmichael function λ(n)271,828the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 543,656
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 271,829, 543,658, 1,087,3166 in total
Arithmetic
Previous number1,087,315
Next number1,087,317
Double2,174,632
Half543,658
Square1,182,256,083,856
Cube1,285,485,956,073,970,496
Square root1,042.744455751≈irrational, shown to 9 decimal places
Cube root102.829705718≈
Negation-1,087,316
Reciprocal9.19695838 × 10^-7≈
Representations
Decimal1,087,316
Binary10000100101110101010021 bits
Octal4113524
Hexadecimal109754
Base 36NAZ8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, eighty-seven thousand, three hundred and sixteen
Ordinalone million, eighty-seven thousand, three hundred and sixteenth
Scientific notation1.087316 × 10^6
Engineering notation1.087316 × 10^6
In other bases
Ternary2001020111222base 3; the most digit-efficient integer base after e: 13 digits
Quinary234243231base 5; one hand: 9 digits
Septenary12146006base 7: 8 digits
Nonary2036458base 9; each digit is two ternary digits: 7 digits
Duodecimal445298base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6fi5gbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:2:1:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0011T1TTT00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011110101101010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001001011101010100
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes310 97 54
Gray code110001101110011111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001001011101010100
64-bit0000000000000000000000000000000000000000000100001001011101010100
One's complement11111111111011110110100010101011at 32 bits, every bit flipped
Bits reversed00101010111010010000100000000000at 32 bits
Rotated left by 100000000001000010010111010101000at 32 bits, wrapping
Shifted left by 11000010010111010101000= 2,174,632, no wrap
Shifted right by 110000100101110101010= 543,658, discarding the low bit
These bits as a double5.37205482 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,087,316 to the power 21,182,256,083,856
1,087,316 to the power 31,285,485,956,073,970,496
1,087,316 to the power 41,397,729,447,814,525,303,828,736
1,087,316 to the power 51,519,773,592,279,898,395,257,845,912,576
First ten multiples1,087,316, 2,174,632, 3,261,948, 4,349,264, 5,436,580, 6,523,896, 7,611,212, 8,698,528, 9,785,844, 10,873,160
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 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 16
Collatz (3n + 1) trajectory
Steps to reach 141the total stopping time
Highest value reached1,087,316
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,087,316 → 543,658 → 271,829 → 815,488 → 407,744 → 203,872 → 101,936 → 50,968 → 25,484 → 12,742 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage108,731,600%
1,087,316% as a decimal10,873.16
1,087,316% of 1001,087,316
1,087,316% of 1,00010,873,160
As a fraction of 1001,087,316/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,087,316
Nerdulate something else
Nothing in mind? Surprise me · today’s page