Recognised as Number
6,849,289
- Positive
- Odd
- Prime
- 7 digits
6,849,289 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,849,289
Digit count7
Digit sum46
Digit product248,832
Multiplicative persistence3times 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,849,289
Distinct prime factors16,849,289
Number of divisors2
Sum of divisors σ(n)6,849,290
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,849,288integers below n that share no factor with it
Carmichael function λ(n)6,849,288the 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,849,2892 in total
Arithmetic
Previous number6,849,288
Next number6,849,290
Double13,698,578
Half3,424,644.5
Square46,912,759,805,521
Cube321,319,049,695,597,124,569
Square root2,617.114632568≈irrational, shown to 9 decimal places
Cube root189.910290059≈
Negation-6,849,289
Reciprocal1.46000556 × 10^-7≈
Representations
Decimal6,849,289
Binary1101000100000110000100123 bits
Octal32101411
Hexadecimal688309
Base 3642SY1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, eight hundred and forty-nine thousand, two hundred and eighty-nine
Ordinalsix million, eight hundred and forty-nine thousand, two hundred and eighty-ninth
Scientific notation6.849289 × 10^6
Engineering notation6.849289 × 10^6
In other bases
Ternary110212222110101base 3; the most digit-efficient integer base after e: 15 digits
Quinary3223134124base 5; one hand: 10 digits
Septenary112134526base 7: 9 digits
Nonary13788411base 9; each digit is two ternary digits: 8 digits
Duodecimal2363861base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal22g349base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:42:34:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1110T000T110101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110011000011100011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010001000001100001001
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 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 83 09
Gray code10111001100001010001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010001000001100001001
64-bit0000000000000000000000000000000000000000011010001000001100001001
One's complement11111111100101110111110011110110at 32 bits, every bit flipped
Bits reversed10010000110000010001011000000000at 32 bits
Rotated left by 100000000110100010000011000010010at 32 bits, wrapping
Shifted left by 1110100010000011000010010= 13,698,578, no wrap
Shifted right by 11101000100000110000100= 3,424,644, discarding the low bit
These bits as a double3.38399839 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,849,289 to the power 246,912,759,805,521
6,849,289 to the power 3321,319,049,695,597,124,569
6,849,289 to the power 42,200,807,032,570,506,733,742,081,441
6,849,289 to the power 515,073,963,399,307,813,495,845,567,250,945,449
First ten multiples6,849,289, 13,698,578, 20,547,867, 27,397,156, 34,246,445, 41,095,734, 47,945,023, 54,794,312, 61,643,601, 68,492,890
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1222the total stopping time
Highest value reached34,674,5325× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,849,289 → 20,547,868 → 10,273,934 → 5,136,967 → 15,410,902 → 7,705,451 → 23,116,354 → 11,558,177 → 34,674,532 → 17,337,266 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage684,928,900%
6,849,289% as a decimal68,492.89
6,849,289% of 1006,849,289
6,849,289% of 1,00068,492,890
As a fraction of 1006,849,289/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,849,289
Nerdulate something else
Nothing in mind? Surprise me · today’s page