Recognised as Number
1,127,020
- Positive
- Even
- Composite
- 7 digits
1,127,020 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,127,020
Digit count7
Digit sum13
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 × 37 × 1,523
Distinct prime factors42, 5, 37, 1,523
Number of divisors24
Sum of divisors σ(n)2,432,304
Aliquot sum1,305,284sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)438,336integers below n that share no factor with it
Carmichael function λ(n)27,396the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 438,336
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 37, 74, 148, 185, 370, 740, 1,523, 3,046, 6,092, 7,615, 15,230, 30,460, 56,351, 112,702, 225,404, 281,755, 563,510, 1,127,02024 in total
Arithmetic
Previous number1,127,019
Next number1,127,021
Double2,254,040
Half563,510
Square1,270,174,080,400
Cube1,431,511,592,092,408,000
Square root1,061.611981846≈irrational, shown to 9 decimal places
Cube root104.066402367≈
Negation-1,127,020
Reciprocal8.872957 × 10^-7≈
Representations
Decimal1,127,020
Binary10001001100100110110021 bits
Octal4231154
Hexadecimal11326C
Base 36O5M4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-seven thousand and twenty
Ordinalone million, one hundred and twenty-seven thousand and twentieth
Scientific notation1.12702 × 10^6
Engineering notation1.12702 × 10^6
In other bases
Ternary2010020222111base 3; the most digit-efficient integer base after e: 13 digits
Quinary242031040base 5; one hand: 9 digits
Septenary12402526base 7: 8 digits
Nonary2106874base 9; each digit is two ternary digits: 7 digits
Duodecimal464264base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal70hb0base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:13:3:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T100T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010111011110111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010011001001101100
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes311 32 6c
Gray code110011010101101011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010011001001101100
64-bit0000000000000000000000000000000000000000000100010011001001101100
One's complement11111111111011101100110110010011at 32 bits, every bit flipped
Bits reversed00110110010011001000100000000000at 32 bits
Rotated left by 100000000001000100110010011011000at 32 bits, wrapping
Shifted left by 11000100110010011011000= 2,254,040, no wrap
Shifted right by 110001001100100110110= 563,510, discarding the low bit
These bits as a double5.56821864 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,127,020 to the power 21,270,174,080,400
1,127,020 to the power 31,431,511,592,092,408,000
1,127,020 to the power 41,613,342,194,519,985,664,160,000
1,127,020 to the power 51,818,268,920,067,914,243,221,603,200,000
First ten multiples1,127,020, 2,254,040, 3,381,060, 4,508,080, 5,635,100, 6,762,120, 7,889,140, 9,016,160, 10,143,180, 11,270,200
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 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 20
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached21,958,93619× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,127,020 → 563,510 → 281,755 → 845,266 → 422,633 → 1,267,900 → 633,950 → 316,975 → 950,926 → 475,463 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,702,000%
1,127,020% as a decimal11,270.2
1,127,020% of 1001,127,020
1,127,020% of 1,00011,270,200
As a fraction of 1001,127,020/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,127,020
Nerdulate something else
Nothing in mind? Surprise me · today’s page