Recognised as Number
6,000,127
- Positive
- Odd
- Composite
- 7 digits
6,000,127 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value6,000,127
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 857,161
Distinct prime factors27, 857,161
Number of divisors4
Sum of divisors σ(n)6,857,296
Aliquot sum857,169sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,142,960integers below n that share no factor with it
Carmichael function λ(n)857,160the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,142,960
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 857,161, 6,000,1274 in total
Arithmetic
Previous number6,000,126
Next number6,000,128
Double12,000,254
Half3,000,063.5
Square36,001,524,016,129
Cube216,013,716,290,324,048,383
Square root2,449.515666412≈irrational, shown to 9 decimal places
Cube root181.713341354≈
Negation-6,000,127
Reciprocal1.66663139 × 10^-7≈
Representations
Decimal6,000,127
Binary1011011100011011111111123 bits
Octal26706777
Hexadecimal5B8DFF
Base 363KLQ7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, one hundred and twenty-seven
Ordinalsix million, one hundred and twenty-seventh
Scientific notation6.000127 × 10^6
Engineering notation6.000127 × 10^6
In other bases
Ternary102021211121221base 3; the most digit-efficient integer base after e: 15 digits
Quinary3014001002base 5; one hand: 10 digits
Septenary102000040base 7: 9 digits
Nonary12254557base 9; each digit is two ternary digits: 8 digits
Duodecimal2014367base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ha067base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal27:46:42:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10T0TTT0T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011001001001000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010110111000110111111111
Bit length23 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits6within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes35b 8d ff
Gray code11101100100101100000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010110111000110111111111
64-bit0000000000000000000000000000000000000000010110111000110111111111
One's complement11111111101001000111001000000000at 32 bits, every bit flipped
Bits reversed11111111101100011101101000000000at 32 bits
Rotated left by 100000000101101110001101111111110at 32 bits, wrapping
Shifted left by 1101101110001101111111110= 12,000,254, no wrap
Shifted right by 11011011100011011111111= 3,000,063, discarding the low bit
These bits as a double2.96445662 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,000,127 to the power 236,001,524,016,129
6,000,127 to the power 3216,013,716,290,324,048,383
6,000,127 to the power 41,296,109,731,483,913,161,452,144,641
6,000,127 to the power 57,776,822,994,839,377,425,684,372,268,369,407
First ten multiples6,000,127, 12,000,254, 18,000,381, 24,000,508, 30,000,635, 36,000,762, 42,000,889, 48,001,016, 54,001,143, 60,001,270
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 27
Collatz (3n + 1) trajectory
Steps to reach 1276the total stopping time
Highest value reached461,330,15276× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,000,127 → 18,000,382 → 9,000,191 → 27,000,574 → 13,500,287 → 40,500,862 → 20,250,431 → 60,751,294 → 30,375,647 → 91,126,942 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage600,012,700%
6,000,127% as a decimal60,001.27
6,000,127% of 1006,000,127
6,000,127% of 1,00060,001,270
As a fraction of 1006,000,127/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 6,000,127
Nerdulate something else
Nothing in mind? Surprise me · today’s page