Recognised as Number
1,189,007
- Positive
- Odd
- Prime
- 7 digits
1,189,007 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,189,007
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 factorisation1,189,007
Distinct prime factors11,189,007
Number of divisors2
Sum of divisors σ(n)1,189,008
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,189,006integers below n that share no factor with it
Carmichael function λ(n)1,189,006the 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,189,0072 in total
Arithmetic
Previous number1,189,006
Next number1,189,008
Double2,378,014
Half594,503.5
Square1,413,737,646,049
Cube1,680,943,957,315,783,343
Square root1,090.415975672≈irrational, shown to 9 decimal places
Cube root105.940366363≈
Negation-1,189,007
Reciprocal8.41037942 × 10^-7≈
Representations
Decimal1,189,007
Binary10010001001001000111121 bits
Octal4422217
Hexadecimal12248F
Base 36PHFZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and eighty-nine thousand and seven
Ordinalone million, one hundred and eighty-nine thousand and seventh
Scientific notation1.189007 × 10^6
Engineering notation1.189007 × 10^6
In other bases
Ternary2020102000022base 3; the most digit-efficient integer base after e: 13 digits
Quinary301022012base 5; one hand: 9 digits
Septenary13051331base 7: 8 digits
Nonary2212008base 9; each digit is two ternary digits: 7 digits
Duodecimal4940bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal78ca7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:30:16:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T011T00010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100110010110010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100010010010001111
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes312 24 8f
Gray code110110011011011001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100010010010001111
64-bit0000000000000000000000000000000000000000000100100010010010001111
One's complement11111111111011011101101101110000at 32 bits, every bit flipped
Bits reversed11110001001001000100100000000000at 32 bits
Rotated left by 100000000001001000100100100011110at 32 bits, wrapping
Shifted left by 11001000100100100011110= 2,378,014, no wrap
Shifted right by 110010001001001000111= 594,503, discarding the low bit
These bits as a double5.87447511 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,189,007 to the power 21,413,737,646,049
1,189,007 to the power 31,680,943,957,315,783,343
1,189,007 to the power 41,998,654,131,856,167,605,310,401
1,189,007 to the power 52,376,413,753,355,906,275,887,303,961,807
First ten multiples1,189,007, 2,378,014, 3,567,021, 4,756,028, 5,945,035, 7,134,042, 8,323,049, 9,512,056, 10,701,063, 11,890,070
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 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 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1173the total stopping time
Highest value reached12,038,70410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,189,007 → 3,567,022 → 1,783,511 → 5,350,534 → 2,675,267 → 8,025,802 → 4,012,901 → 12,038,704 → 6,019,352 → 3,009,676 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage118,900,700%
1,189,007% as a decimal11,890.07
1,189,007% of 1001,189,007
1,189,007% of 1,00011,890,070
As a fraction of 1001,189,007/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,007
Nerdulate something else
Nothing in mind? Surprise me · today’s page