Recognised as Number
6,760,079
- Positive
- Odd
- Prime
- 7 digits
6,760,079 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,760,079
Digit count7
Digit sum35
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,760,079
Distinct prime factors16,760,079
Number of divisors2
Sum of divisors σ(n)6,760,080
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,760,078integers below n that share no factor with it
Carmichael function λ(n)6,760,078the 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,760,0792 in total
Arithmetic
Previous number6,760,078
Next number6,760,080
Double13,520,158
Half3,380,039.5
Square45,698,668,086,241
Cube308,926,606,457,767,973,039
Square root2,600.015192263≈irrational, shown to 9 decimal places
Cube root189.082175477≈
Negation-6,760,079
Reciprocal1.47927265 × 10^-7≈
Representations
Decimal6,760,079
Binary1100111001001101000111123 bits
Octal31623217
Hexadecimal67268F
Base 3640W3Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and sixty thousand and seventy-nine
Ordinalsix million, seven hundred and sixty thousand and seventy-ninth
Scientific notation6.760079 × 10^6
Engineering notation6.760079 × 10^6
In other bases
Ternary110201110002022base 3; the most digit-efficient integer base after e: 15 digits
Quinary3212310304base 5; one hand: 10 digits
Septenary111313454base 7: 9 digits
Nonary13643068base 9; each digit is two ternary digits: 8 digits
Duodecimal23200bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal22503jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:17:47:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0111001T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110110111101110010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001110010011010001111
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
Bytes367 26 8f
Gray code10101001011010111001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001110010011010001111
64-bit0000000000000000000000000000000000000000011001110010011010001111
One's complement11111111100110001101100101110000at 32 bits, every bit flipped
Bits reversed11110001011001001110011000000000at 32 bits
Rotated left by 100000000110011100100110100011110at 32 bits, wrapping
Shifted left by 1110011100100110100011110= 13,520,158, no wrap
Shifted right by 11100111001001101000111= 3,380,039, discarding the low bit
These bits as a double3.3399228 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,760,079 to the power 245,698,668,086,241
6,760,079 to the power 3308,926,606,457,767,973,039
6,760,079 to the power 42,088,368,264,856,421,661,413,510,081
6,760,079 to the power 514,117,534,451,522,334,088,466,579,814,856,399
First ten multiples6,760,079, 13,520,158, 20,280,237, 27,040,316, 33,800,395, 40,560,474, 47,320,553, 54,080,632, 60,840,711, 67,600,790
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached138,759,31620× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,760,079 → 20,280,238 → 10,140,119 → 30,420,358 → 15,210,179 → 45,630,538 → 22,815,269 → 68,445,808 → 34,222,904 → 17,111,452 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage676,007,900%
6,760,079% as a decimal67,600.79
6,760,079% of 1006,760,079
6,760,079% of 1,00067,600,790
As a fraction of 1006,760,079/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,760,079
Nerdulate something else
Nothing in mind? Surprise me · today’s page