Recognised as Number
1,327,987
- Positive
- Odd
- Prime
- 7 digits
1,327,987 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,327,987
Digit count7
Digit sum37
Digit product21,168
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,327,987
Distinct prime factors11,327,987
Number of divisors2
Sum of divisors σ(n)1,327,988
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,327,986integers below n that share no factor with it
Carmichael function λ(n)1,327,986the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,327,9872 in total
Arithmetic
Previous number1,327,986
Next number1,327,988
Double2,655,974
Half663,993.5
Square1,763,549,472,169
Cube2,341,970,772,897,293,803
Square root1,152.3831828≈irrational, shown to 9 decimal places
Cube root109.916934535≈
Negation-1,327,987
Reciprocal7.5301942 × 10^-7≈
Representations
Decimal1,327,987
Binary10100010000110111001121 bits
Octal5041563
Hexadecimal144373
Base 36SGOJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and twenty-seven thousand, nine hundred and eighty-seven
Ordinalone million, three hundred and twenty-seven thousand, nine hundred and eighty-seventh
Scientific notation1.327987 × 10^6
Engineering notation1.327987 × 10^6
In other bases
Ternary2111110122201base 3; the most digit-efficient integer base after e: 13 digits
Quinary314443422base 5; one hand: 9 digits
Septenary14200453base 7: 8 digits
Nonary2443581base 9; each digit is two ternary digits: 7 digits
Duodecimal540617base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal85jj7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:8:53:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111111T00T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000100010010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000100001101110011
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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
Bytes314 43 73
Gray code111100110001011001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000100001101110011
64-bit0000000000000000000000000000000000000000000101000100001101110011
One's complement11111111111010111011110010001100at 32 bits, every bit flipped
Bits reversed11001110110000100010100000000000at 32 bits
Rotated left by 100000000001010001000011011100110at 32 bits, wrapping
Shifted left by 11010001000011011100110= 2,655,974, no wrap
Shifted right by 110100010000110111001= 663,993, discarding the low bit
These bits as a double6.56112755 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,327,987 to the power 21,763,549,472,169
1,327,987 to the power 32,341,970,772,897,293,803
1,327,987 to the power 43,110,106,740,787,558,505,564,561
1,327,987 to the power 54,130,181,320,378,247,457,129,164,668,707
First ten multiples1,327,987, 2,655,974, 3,983,961, 5,311,948, 6,639,935, 7,967,922, 9,295,909, 10,623,896, 11,951,883, 13,279,870
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 167the total stopping time
Highest value reached5,975,9444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,327,987 → 3,983,962 → 1,991,981 → 5,975,944 → 2,987,972 → 1,493,986 → 746,993 → 2,240,980 → 1,120,490 → 560,245 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage132,798,700%
1,327,987% as a decimal13,279.87
1,327,987% of 1001,327,987
1,327,987% of 1,00013,279,870
As a fraction of 1001,327,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 1,327,987
Nerdulate something else
Nothing in mind? Surprise me · today’s page