Recognised as Number
6,897,991
- Positive
- Odd
- Prime
- 7 digits
6,897,991 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,897,991
Digit count7
Digit sum49
Digit product244,944
Multiplicative persistence3times 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,897,991
Distinct prime factors16,897,991
Number of divisors2
Sum of divisors σ(n)6,897,992
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,897,990integers below n that share no factor with it
Carmichael function λ(n)6,897,990the 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,897,9912 in total
Arithmetic
Previous number6,897,990
Next number6,897,992
Double13,795,982
Half3,448,995.5
Square47,582,279,836,081
Cube328,222,138,068,768,213,271
Square root2,626.402672859≈irrational, shown to 9 decimal places
Cube root190.359347637≈
Negation-6,897,991
Reciprocal1.44969746 × 10^-7≈
Representations
Decimal6,897,991
Binary1101001010000010100011123 bits
Octal32240507
Hexadecimal694147
Base 3643UIV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, eight hundred and ninety-seven thousand, nine hundred and ninety-one
Ordinalsix million, eight hundred and ninety-seven thousand, nine hundred and ninety-first
Scientific notation6.897991 × 10^6
Engineering notation6.897991 × 10^6
In other bases
Ternary110222110021011base 3; the most digit-efficient integer base after e: 15 digits
Quinary3231213431base 5; one hand: 10 digits
Septenary112426522base 7: 9 digits
Nonary13873234base 9; each digit is two ternary digits: 8 digits
Duodecimal2387a87base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2324jbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:56:6:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11100T1101T1011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110010100000101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010010100000101000111
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 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
Bytes369 41 47
Gray code10111011110000111100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010010100000101000111
64-bit0000000000000000000000000000000000000000011010010100000101000111
One's complement11111111100101101011111010111000at 32 bits, every bit flipped
Bits reversed11100010100000101001011000000000at 32 bits
Rotated left by 100000000110100101000001010001110at 32 bits, wrapping
Shifted left by 1110100101000001010001110= 13,795,982, no wrap
Shifted right by 11101001010000010100011= 3,448,995, discarding the low bit
These bits as a double3.40806038 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,897,991 to the power 247,582,279,836,081
6,897,991 to the power 3328,222,138,068,768,213,271
6,897,991 to the power 42,264,073,354,399,120,516,229,438,561
6,897,991 to the power 515,617,557,621,984,943,728,866,021,128,830,951
First ten multiples6,897,991, 13,795,982, 20,693,973, 27,591,964, 34,489,955, 41,387,946, 48,285,937, 55,183,928, 62,081,919, 68,979,910
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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1359the total stopping time
Highest value reached1,379,365,684199× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,897,991 → 20,693,974 → 10,346,987 → 31,040,962 → 15,520,481 → 46,561,444 → 23,280,722 → 11,640,361 → 34,921,084 → 17,460,542 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage689,799,100%
6,897,991% as a decimal68,979.91
6,897,991% of 1006,897,991
6,897,991% of 1,00068,979,910
As a fraction of 1006,897,991/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,897,991
Nerdulate something else
Nothing in mind? Surprise me · today’s page