Recognised as Number
1,136,379
- Positive
- Odd
- Composite
- 7 digits
1,136,379 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,136,379
Digit count7
Digit sum30
Digit product3,402
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 378,793
Distinct prime factors23, 378,793
Number of divisors4
Sum of divisors σ(n)1,515,176
Aliquot sum378,797sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)757,584integers below n that share no factor with it
Carmichael function λ(n)378,792the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 757,584
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 378,793, 1,136,3794 in total
Arithmetic
Previous number1,136,378
Next number1,136,380
Double2,272,758
Half568,189.5
Square1,291,357,231,641
Cube1,467,471,239,534,967,939
Square root1,066.010787938≈irrational, shown to 9 decimal places
Cube root104.353671404≈
Negation-1,136,379
Reciprocal8.79988103 × 10^-7≈
Representations
Decimal1,136,379
Binary10001010101101111101121 bits
Octal4253373
Hexadecimal1156FB
Base 36OCU3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-six thousand, three hundred and seventy-nine
Ordinalone million, one hundred and thirty-six thousand, three hundred and seventy-ninth
Scientific notation1.136379 × 10^6
Engineering notation1.136379 × 10^6
In other bases
Ternary2010201211010base 3; the most digit-efficient integer base after e: 13 digits
Quinary242331004base 5; one hand: 9 digits
Septenary12442026base 7: 8 digits
Nonary2121733base 9; each digit is two ternary digits: 7 digits
Duodecimal469763base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal720ijbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:15:39:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011T1TT11010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101010101100001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010101011011111011
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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
Bytes311 56 fb
Gray code110011111110110000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010101011011111011
64-bit0000000000000000000000000000000000000000000100010101011011111011
One's complement11111111111011101010100100000100at 32 bits, every bit flipped
Bits reversed11011111011010101000100000000000at 32 bits
Rotated left by 100000000001000101010110111110110at 32 bits, wrapping
Shifted left by 11000101010110111110110= 2,272,758, no wrap
Shifted right by 110001010101101111101= 568,189, discarding the low bit
These bits as a double5.61445825 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,136,379 to the power 21,291,357,231,641
1,136,379 to the power 31,467,471,239,534,967,939
1,136,379 to the power 41,667,603,499,711,507,331,552,881
1,136,379 to the power 51,895,029,597,398,662,989,922,731,357,899
First ten multiples1,136,379, 2,272,758, 3,409,137, 4,545,516, 5,681,895, 6,818,274, 7,954,653, 9,091,032, 10,227,411, 11,363,790
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1222the total stopping time
Highest value reached9,708,0648× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,136,379 → 3,409,138 → 1,704,569 → 5,113,708 → 2,556,854 → 1,278,427 → 3,835,282 → 1,917,641 → 5,752,924 → 2,876,462 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,637,900%
1,136,379% as a decimal11,363.79
1,136,379% of 1001,136,379
1,136,379% of 1,00011,363,790
As a fraction of 1001,136,379/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,136,379
Nerdulate something else
Nothing in mind? Surprise me · today’s page