Recognised as Number
1,159,937
- Positive
- Odd
- Composite
- 7 digits
1,159,937 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,159,937
Digit count7
Digit sum35
Digit product8,505
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 factorisation89 × 13,033
Distinct prime factors289, 13,033
Number of divisors4
Sum of divisors σ(n)1,173,060
Aliquot sum13,123sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,146,816integers below n that share no factor with it
Carmichael function λ(n)143,352the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,146,816
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 89, 13,033, 1,159,9374 in total
Arithmetic
Previous number1,159,936
Next number1,159,938
Double2,319,874
Half579,968.5
Square1,345,453,843,969
Cube1,560,641,695,411,869,953
Square root1,077.003714014≈irrational, shown to 9 decimal places
Cube root105.069855254≈
Negation-1,159,937
Reciprocal8.62115787 × 10^-7≈
Representations
Decimal1,159,937
Binary10001101100110000000121 bits
Octal4331401
Hexadecimal11B301
Base 36OV0H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and fifty-nine thousand, nine hundred and thirty-seven
Ordinalone million, one hundred and fifty-nine thousand, nine hundred and thirty-seventh
Scientific notation1.159937 × 10^6
Engineering notation1.159937 × 10^6
In other bases
Ternary2011221010122base 3; the most digit-efficient integer base after e: 13 digits
Quinary244104222base 5; one hand: 9 digits
Septenary12600512base 7: 8 digits
Nonary2157118base 9; each digit is two ternary digits: 7 digits
Duodecimal47b315base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal74jghbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:22:12:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT0T1011T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101111011100000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100011011001100000001
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
Bytes311 b3 01
Gray code110010110101010000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100011011001100000001
64-bit0000000000000000000000000000000000000000000100011011001100000001
One's complement11111111111011100100110011111110at 32 bits, every bit flipped
Bits reversed10000000110011011000100000000000at 32 bits
Rotated left by 100000000001000110110011000000010at 32 bits, wrapping
Shifted left by 11000110110011000000010= 2,319,874, no wrap
Shifted right by 110001101100110000000= 579,968, discarding the low bit
These bits as a double5.73085023 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,159,937 to the power 21,345,453,843,969
1,159,937 to the power 31,560,641,695,411,869,953
1,159,937 to the power 41,810,246,046,250,958,197,672,961
1,159,937 to the power 52,099,771,368,150,197,698,934,181,363,457
First ten multiples1,159,937, 2,319,874, 3,479,811, 4,639,748, 5,799,685, 6,959,622, 8,119,559, 9,279,496, 10,439,433, 11,599,370
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 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 198the total stopping time
Highest value reached3,479,8123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,159,937 → 3,479,812 → 1,739,906 → 869,953 → 2,609,860 → 1,304,930 → 652,465 → 1,957,396 → 978,698 → 489,349 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage115,993,700%
1,159,937% as a decimal11,599.37
1,159,937% of 1001,159,937
1,159,937% of 1,00011,599,370
As a fraction of 1001,159,937/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,159,937
Nerdulate something else
Nothing in mind? Surprise me · today’s page