Recognised as Number
6,766,411
- Positive
- Odd
- Prime
- 7 digits
6,766,411 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,766,411
Digit count7
Digit sum31
Digit product6,048
Multiplicative persistence2times 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 factorisation6,766,411
Distinct prime factors16,766,411
Number of divisors2
Sum of divisors σ(n)6,766,412
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,766,410integers below n that share no factor with it
Carmichael function λ(n)6,766,410the 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,766,4112 in total
Arithmetic
Previous number6,766,410
Next number6,766,412
Double13,532,822
Half3,383,205.5
Square45,784,317,820,921
Cube309,795,511,730,975,884,531
Square root2,601.232592445≈irrational, shown to 9 decimal places
Cube root189.141193264≈
Negation-6,766,411
Reciprocal1.47788835 × 10^-7≈
Representations
Decimal6,766,411
Binary1100111001111110100101123 bits
Octal31637513
Hexadecimal673F4B
Base 36410ZV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and sixty-six thousand, four hundred and eleven
Ordinalsix million, seven hundred and sixty-six thousand, four hundred and eleventh
Scientific notation6.766411 × 10^6
Engineering notation6.766411 × 10^6
In other bases
Ternary110201202202211base 3; the most digit-efficient integer base after e: 15 digits
Quinary3213011121base 5; one hand: 10 digits
Septenary111341101base 7: 9 digits
Nonary13652684base 9; each digit is two ternary digits: 8 digits
Duodecimal23238b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal225g0bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:19:33:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T1TT10T10T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110110100001101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001110011111101001011
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 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
Bytes367 3f 4b
Gray code10101001010000011101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001110011111101001011
64-bit0000000000000000000000000000000000000000011001110011111101001011
One's complement11111111100110001100000010110100at 32 bits, every bit flipped
Bits reversed11010010111111001110011000000000at 32 bits
Rotated left by 100000000110011100111111010010110at 32 bits, wrapping
Shifted left by 1110011100111111010010110= 13,532,822, no wrap
Shifted right by 11100111001111110100101= 3,383,205, discarding the low bit
These bits as a double3.34305122 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,766,411 to the power 245,784,317,820,921
6,766,411 to the power 3309,795,511,730,975,884,531
6,766,411 to the power 42,096,203,758,327,104,265,825,288,241
6,766,411 to the power 514,183,776,168,585,859,902,427,154,432,073,051
First ten multiples6,766,411, 13,532,822, 20,299,233, 27,065,644, 33,832,055, 40,598,466, 47,364,877, 54,131,288, 60,897,699, 67,664,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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1134the total stopping time
Highest value reached30,448,8524× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,766,411 → 20,299,234 → 10,149,617 → 30,448,852 → 15,224,426 → 7,612,213 → 22,836,640 → 11,418,320 → 5,709,160 → 2,854,580 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage676,641,100%
6,766,411% as a decimal67,664.11
6,766,411% of 1006,766,411
6,766,411% of 1,00067,664,110
As a fraction of 1006,766,411/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,766,411
Nerdulate something else
Nothing in mind? Surprise me · today’s page