Recognised as Number
1,127,001
- Positive
- Odd
- Composite
- 7 digits
1,127,001 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,127,001
Digit count7
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 375,667
Distinct prime factors23, 375,667
Number of divisors4
Sum of divisors σ(n)1,502,672
Aliquot sum375,671sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)751,332integers below n that share no factor with it
Carmichael function λ(n)375,666the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 751,332
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 375,667, 1,127,0014 in total
Arithmetic
Previous number1,127,000
Next number1,127,002
Double2,254,002
Half563,500.5
Square1,270,131,254,001
Cube1,431,439,193,390,381,001
Square root1,061.603033153≈irrational, shown to 9 decimal places
Cube root104.065817559≈
Negation-1,127,001
Reciprocal8.87310659 × 10^-7≈
Representations
Decimal1,127,001
Binary10001001100100101100121 bits
Octal4231131
Hexadecimal113259
Base 36O5LL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-seven thousand and one
Ordinalone million, one hundred and twenty-seven thousand and first
Scientific notation1.127001 × 10^6
Engineering notation1.127001 × 10^6
In other bases
Ternary2010020221210base 3; the most digit-efficient integer base after e: 13 digits
Quinary242031001base 5; one hand: 9 digits
Septenary12402501base 7: 8 digits
Nonary2106853base 9; each digit is two ternary digits: 7 digits
Duodecimal464249base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal70ha1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:13:3:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T100TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010111011110101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010011001001011001
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 32 59
Gray code110011010101101110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010011001001011001
64-bit0000000000000000000000000000000000000000000100010011001001011001
One's complement11111111111011101100110110100110at 32 bits, every bit flipped
Bits reversed10011010010011001000100000000000at 32 bits
Rotated left by 100000000001000100110010010110010at 32 bits, wrapping
Shifted left by 11000100110010010110010= 2,254,002, no wrap
Shifted right by 110001001100100101100= 563,500, discarding the low bit
These bits as a double5.56812477 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,127,001 to the power 21,270,131,254,001
1,127,001 to the power 31,431,439,193,390,381,001
1,127,001 to the power 41,613,233,402,390,152,778,508,001
1,127,001 to the power 51,818,115,657,727,104,571,531,295,635,001
First ten multiples1,127,001, 2,254,002, 3,381,003, 4,508,004, 5,635,005, 6,762,006, 7,889,007, 9,016,008, 10,143,009, 11,270,010
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1284the total stopping time
Highest value reached13,708,60012× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,127,001 → 3,381,004 → 1,690,502 → 845,251 → 2,535,754 → 1,267,877 → 3,803,632 → 1,901,816 → 950,908 → 475,454 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,700,100%
1,127,001% as a decimal11,270.01
1,127,001% of 1001,127,001
1,127,001% of 1,00011,270,010
As a fraction of 1001,127,001/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,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page