Recognised as Number
1,186,397
- Positive
- Odd
- Prime
- 7 digits
1,186,397 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,186,397
Digit count7
Digit sum35
Digit product9,072
Multiplicative persistence2times 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,186,397
Distinct prime factors11,186,397
Number of divisors2
Sum of divisors σ(n)1,186,398
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,186,396integers below n that share no factor with it
Carmichael function λ(n)1,186,396the 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,186,3972 in total
Arithmetic
Previous number1,186,396
Next number1,186,398
Double2,372,794
Half593,198.5
Square1,407,537,841,609
Cube1,669,898,672,671,392,773
Square root1,089.218527202≈irrational, shown to 9 decimal places
Cube root105.862792689≈
Negation-1,186,397
Reciprocal8.42888173 × 10^-7≈
Representations
Decimal1,186,397
Binary10010000110100101110121 bits
Octal4415135
Hexadecimal121A5D
Base 36PFFH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and eighty-six thousand, three hundred and ninety-seven
Ordinalone million, one hundred and eighty-six thousand, three hundred and ninety-seventh
Scientific notation1.186397 × 10^6
Engineering notation1.186397 × 10^6
In other bases
Ternary2020021102122base 3; the most digit-efficient integer base after e: 13 digits
Quinary300431042base 5; one hand: 9 digits
Septenary13040612base 7: 8 digits
Nonary2207378base 9; each digit is two ternary digits: 7 digits
Duodecimal4926a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal785jhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:29:33:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T01T1110T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100110111110101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100001101001011101
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
Bytes312 1a 5d
Gray code110110001011101110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100001101001011101
64-bit0000000000000000000000000000000000000000000100100001101001011101
One's complement11111111111011011110010110100010at 32 bits, every bit flipped
Bits reversed10111010010110000100100000000000at 32 bits
Rotated left by 100000000001001000011010010111010at 32 bits, wrapping
Shifted left by 11001000011010010111010= 2,372,794, no wrap
Shifted right by 110010000110100101110= 593,198, discarding the low bit
These bits as a double5.86158 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,186,397 to the power 21,407,537,841,609
1,186,397 to the power 31,669,898,672,671,392,773
1,186,397 to the power 41,981,162,775,561,322,371,708,881
1,186,397 to the power 52,350,445,573,437,626,177,828,301,291,757
First ten multiples1,186,397, 2,372,794, 3,559,191, 4,745,588, 5,931,985, 7,118,382, 8,304,779, 9,491,176, 10,677,573, 11,863,970
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 1121the total stopping time
Highest value reached3,559,1923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,186,397 → 3,559,192 → 1,779,596 → 889,798 → 444,899 → 1,334,698 → 667,349 → 2,002,048 → 1,001,024 → 500,512 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage118,639,700%
1,186,397% as a decimal11,863.97
1,186,397% of 1001,186,397
1,186,397% of 1,00011,863,970
As a fraction of 1001,186,397/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,186,397
Nerdulate something else
Nothing in mind? Surprise me · today’s page