Recognised as Number
1,189,987
- Positive
- Odd
- Composite
- 7 digits
1,189,987 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,189,987
Digit count7
Digit sum43
Digit product36,288
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation67 × 17,761
Distinct prime factors267, 17,761
Number of divisors4
Sum of divisors σ(n)1,207,816
Aliquot sum17,829sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,172,160integers below n that share no factor with it
Carmichael function λ(n)195,360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,172,160
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 67, 17,761, 1,189,9874 in total
Arithmetic
Previous number1,189,986
Next number1,189,988
Double2,379,974
Half594,993.5
Square1,416,069,060,169
Cube1,685,103,772,703,327,803
Square root1,090.865252907≈irrational, shown to 9 decimal places
Cube root105.969464326≈
Negation-1,189,987
Reciprocal8.40345315 × 10^-7≈
Representations
Decimal1,189,987
Binary10010001010000110001121 bits
Octal4424143
Hexadecimal122863
Base 36PI77
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and eighty-nine thousand, nine hundred and eighty-seven
Ordinalone million, one hundred and eighty-nine thousand, nine hundred and eighty-seventh
Scientific notation1.189987 × 10^6
Engineering notation1.189987 × 10^6
In other bases
Ternary2020110100121base 3; the most digit-efficient integer base after e: 13 digits
Quinary301034422base 5; one hand: 9 digits
Septenary13054231base 7: 8 digits
Nonary2213317base 9; each digit is two ternary digits: 7 digits
Duodecimal494797base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal78ej7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:30:33:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T0110101TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100111100110100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100010100001100011
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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
Bytes312 28 63
Gray code110110011110001010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100010100001100011
64-bit0000000000000000000000000000000000000000000100100010100001100011
One's complement11111111111011011101011110011100at 32 bits, every bit flipped
Bits reversed11000110000101000100100000000000at 32 bits
Rotated left by 100000000001001000101000011000110at 32 bits, wrapping
Shifted left by 11001000101000011000110= 2,379,974, no wrap
Shifted right by 110010001010000110001= 594,993, discarding the low bit
These bits as a double5.87931696 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,189,987 to the power 21,416,069,060,169
1,189,987 to the power 31,685,103,772,703,327,803
1,189,987 to the power 42,005,251,583,167,914,942,308,561
1,189,987 to the power 52,386,223,315,699,237,598,452,937,578,707
First ten multiples1,189,987, 2,379,974, 3,569,961, 4,759,948, 5,949,935, 7,139,922, 8,329,909, 9,519,896, 10,709,883, 11,899,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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 167the total stopping time
Highest value reached5,354,9444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,189,987 → 3,569,962 → 1,784,981 → 5,354,944 → 2,677,472 → 1,338,736 → 669,368 → 334,684 → 167,342 → 83,671 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage118,998,700%
1,189,987% as a decimal11,899.87
1,189,987% of 1001,189,987
1,189,987% of 1,00011,899,870
As a fraction of 1001,189,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,189,987
Nerdulate something else
Nothing in mind? Surprise me · today’s page