Recognised as Number
1,136,380
- Positive
- Even
- Composite
- 7 digits
1,136,380 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,136,380
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 5 × 7 × 8,117
Distinct prime factors42, 5, 7, 8,117
Number of divisors24
Sum of divisors σ(n)2,727,648
Aliquot sum1,591,268sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)389,568integers below n that share no factor with it
Carmichael function λ(n)24,348the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 389,568
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 140, 8,117, 16,234, 32,468, 40,585, 56,819, 81,170, 113,638, 162,340, 227,276, 284,095, 568,190, 1,136,38024 in total
Arithmetic
Previous number1,136,379
Next number1,136,381
Double2,272,760
Half568,190
Square1,291,359,504,400
Cube1,467,475,113,610,072,000
Square root1,066.011256976≈irrational, shown to 9 decimal places
Cube root104.353702014≈
Negation-1,136,380
Reciprocal8.79987328 × 10^-7≈
Representations
Decimal1,136,380
Binary10001010101101111110021 bits
Octal4253374
Hexadecimal1156FC
Base 36OCU4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-six thousand, three hundred and eighty
Ordinalone million, one hundred and thirty-six thousand, three hundred and eightieth
Scientific notation1.13638 × 10^6
Engineering notation1.13638 × 10^6
In other bases
Ternary2010201211011base 3; the most digit-efficient integer base after e: 13 digits
Quinary242331010base 5; one hand: 9 digits
Septenary12442030base 7: 8 digits
Nonary2121734base 9; each digit is two ternary digits: 7 digits
Duodecimal469764base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal720j0base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:15:39:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011T1TT11011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101010101100001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010101011011111100
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes311 56 fc
Gray code110011111110110000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010101011011111100
64-bit0000000000000000000000000000000000000000000100010101011011111100
One's complement11111111111011101010100100000011at 32 bits, every bit flipped
Bits reversed00111111011010101000100000000000at 32 bits
Rotated left by 100000000001000101010110111111000at 32 bits, wrapping
Shifted left by 11000101010110111111000= 2,272,760, no wrap
Shifted right by 110001010101101111110= 568,190, discarding the low bit
These bits as a double5.61446319 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,136,380 to the power 21,291,359,504,400
1,136,380 to the power 31,467,475,113,610,072,000
1,136,380 to the power 41,667,609,369,604,213,619,360,000
1,136,380 to the power 51,895,037,935,430,836,272,768,316,800,000
First ten multiples1,136,380, 2,272,760, 3,409,140, 4,545,520, 5,681,900, 6,818,280, 7,954,660, 9,091,040, 10,227,420, 11,363,800
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 80
Collatz (3n + 1) trajectory
Steps to reach 1116the total stopping time
Highest value reached24,573,61621× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,136,380 → 568,190 → 284,095 → 852,286 → 426,143 → 1,278,430 → 639,215 → 1,917,646 → 958,823 → 2,876,470 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,638,000%
1,136,380% as a decimal11,363.8
1,136,380% of 1001,136,380
1,136,380% of 1,00011,363,800
As a fraction of 1001,136,380/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,380
Nerdulate something else
Nothing in mind? Surprise me · today’s page