Recognised as Number
6,879,673
- Positive
- Odd
- Prime
- 7 digits
6,879,673 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,879,673
Digit count7
Digit sum46
Digit product381,024
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,879,673
Distinct prime factors16,879,673
Number of divisors2
Sum of divisors σ(n)6,879,674
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,879,672integers below n that share no factor with it
Carmichael function λ(n)6,879,672the 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,879,6732 in total
Arithmetic
Previous number6,879,672
Next number6,879,674
Double13,759,346
Half3,439,836.5
Square47,329,900,586,929
Cube325,614,239,160,579,594,217
Square root2,622.913075189≈irrational, shown to 9 decimal places
Cube root190.19069497≈
Negation-6,879,673
Reciprocal1.45355746 × 10^-7≈
Representations
Decimal6,879,673
Binary1101000111110011011100123 bits
Octal32174671
Hexadecimal68F9B9
Base 3643GE1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, eight hundred and seventy-nine thousand, six hundred and seventy-three
Ordinalsix million, eight hundred and seventy-nine thousand, six hundred and seventy-third
Scientific notation6.879673 × 10^6
Engineering notation6.879673 × 10^6
In other bases
Ternary110221112010201base 3; the most digit-efficient integer base after e: 15 digits
Quinary3230122143base 5; one hand: 10 digits
Septenary112322233base 7: 9 digits
Nonary13845121base 9; each digit is two ternary digits: 8 digits
Duodecimal2379361base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal22jj3dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:51:1:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11100TTTT011T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110010000111011001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010001111100110111001
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 set bits, so even; 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
Bytes368 f9 b9
Gray code10111001000010101100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010001111100110111001
64-bit0000000000000000000000000000000000000000011010001111100110111001
One's complement11111111100101110000011001000110at 32 bits, every bit flipped
Bits reversed10011101100111110001011000000000at 32 bits
Rotated left by 100000000110100011111001101110010at 32 bits, wrapping
Shifted left by 1110100011111001101110010= 13,759,346, no wrap
Shifted right by 11101000111110011011100= 3,439,836, discarding the low bit
These bits as a double3.39901008 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,879,673 to the power 247,329,900,586,929
6,879,673 to the power 3325,614,239,160,579,594,217
6,879,673 to the power 42,240,119,489,568,582,098,685,651,041
6,879,673 to the power 515,411,289,569,158,755,912,611,008,954,189,593
First ten multiples6,879,673, 13,759,346, 20,639,019, 27,518,692, 34,398,365, 41,278,038, 48,157,711, 55,037,384, 61,917,057, 68,796,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1191the total stopping time
Highest value reached23,218,9003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,879,673 → 20,639,020 → 10,319,510 → 5,159,755 → 15,479,266 → 7,739,633 → 23,218,900 → 11,609,450 → 5,804,725 → 17,414,176 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage687,967,300%
6,879,673% as a decimal68,796.73
6,879,673% of 1006,879,673
6,879,673% of 1,00068,796,730
As a fraction of 1006,879,673/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,879,673
Nerdulate something else
Nothing in mind? Surprise me · today’s page