Recognised as Number
6,711,011
- Positive
- Odd
- Prime
- 7 digits
6,711,011 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,711,011
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,711,011
Distinct prime factors16,711,011
Number of divisors2
Sum of divisors σ(n)6,711,012
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,711,010integers below n that share no factor with it
Carmichael function λ(n)6,711,010the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 6,711,0112 in total
Arithmetic
Previous number6,711,010
Next number6,711,012
Double13,422,022
Half3,355,505.5
Square45,037,668,642,121
Cube302,248,289,671,629,094,331
Square root2,590.561908158≈irrational, shown to 9 decimal places
Cube root188.623580098≈
Negation-6,711,011
Reciprocal1.49008845 × 10^-7≈
Representations
Decimal6,711,011
Binary1100110011001101110001123 bits
Octal31463343
Hexadecimal6666E3
Base 363ZU8Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and eleven thousand and eleven
Ordinalsix million, seven hundred and eleven thousand and eleventh
Scientific notation6.711011 × 10^6
Engineering notation6.711011 × 10^6
In other bases
Ternary110121221202222base 3; the most digit-efficient integer base after e: 15 digits
Quinary3204223021base 5; one hand: 10 digits
Septenary111020426base 7: 9 digits
Nonary13557688base 9; each digit is two ternary digits: 8 digits
Duodecimal22b782bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal21ihabbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:4:10:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0T00TT1000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110111011101100100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001100110011011100011
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes366 66 e3
Gray code10101010101010110010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001100110011011100011
64-bit0000000000000000000000000000000000000000011001100110011011100011
One's complement11111111100110011001100100011100at 32 bits, every bit flipped
Bits reversed11000111011001100110011000000000at 32 bits
Rotated left by 100000000110011001100110111000110at 32 bits, wrapping
Shifted left by 1110011001100110111000110= 13,422,022, no wrap
Shifted right by 11100110011001101110001= 3,355,505, discarding the low bit
These bits as a double3.31567998 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,711,011 to the power 245,037,668,642,121
6,711,011 to the power 3302,248,289,671,629,094,331
6,711,011 to the power 42,028,391,596,717,489,239,975,378,641
6,711,011 to the power 513,612,558,317,878,634,181,856,405,788,916,051
First ten multiples6,711,011, 13,422,022, 20,133,033, 26,844,044, 33,555,055, 40,266,066, 46,977,077, 53,688,088, 60,399,099, 67,110,110
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1147the total stopping time
Highest value reached30,199,5524× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,711,011 → 20,133,034 → 10,066,517 → 30,199,552 → 15,099,776 → 7,549,888 → 3,774,944 → 1,887,472 → 943,736 → 471,868 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage671,101,100%
6,711,011% as a decimal67,110.11
6,711,011% of 1006,711,011
6,711,011% of 1,00067,110,110
As a fraction of 1006,711,011/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,711,011
Nerdulate something else
Nothing in mind? Surprise me · today’s page