Recognised as Number
6,718,031
- Positive
- Odd
- Prime
- 7 digits
6,718,031 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,718,031
Digit count7
Digit sum26
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,718,031
Distinct prime factors16,718,031
Number of divisors2
Sum of divisors σ(n)6,718,032
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,718,030integers below n that share no factor with it
Carmichael function λ(n)6,718,030the 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,718,0312 in total
Arithmetic
Previous number6,718,030
Next number6,718,032
Double13,436,062
Half3,359,015.5
Square45,131,940,516,961
Cube303,197,775,483,100,023,791
Square root2,591.91647242≈irrational, shown to 9 decimal places
Cube root188.68932658≈
Negation-6,718,031
Reciprocal1.48853139 × 10^-7≈
Representations
Decimal6,718,031
Binary1100110100000100100111123 bits
Octal31501117
Hexadecimal66824F
Base 363ZZNZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and eighteen thousand and thirty-one
Ordinalsix million, seven hundred and eighteen thousand and thirty-first
Scientific notation6.718031 × 10^6
Engineering notation6.718031 × 10^6
In other bases
Ternary110122022101222base 3; the most digit-efficient integer base after e: 15 digits
Quinary3204434111base 5; one hand: 10 digits
Septenary111050045base 7: 9 digits
Nonary13568358base 9; each digit is two ternary digits: 8 digits
Duodecimal22bb8bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal21jf1bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:6:7:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0T10T11T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110111000011001010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001101000001001001111
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 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
Bytes366 82 4f
Gray code10101011100001101101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001101000001001001111
64-bit0000000000000000000000000000000000000000011001101000001001001111
One's complement11111111100110010111110110110000at 32 bits, every bit flipped
Bits reversed11110010010000010110011000000000at 32 bits
Rotated left by 100000000110011010000010010011110at 32 bits, wrapping
Shifted left by 1110011010000010010011110= 13,436,062, no wrap
Shifted right by 11100110100000100100111= 3,359,015, discarding the low bit
These bits as a double3.31914832 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,718,031 to the power 245,131,940,516,961
6,718,031 to the power 3303,197,775,483,100,023,791
6,718,031 to the power 42,036,892,054,826,505,935,928,675,521
6,718,031 to the power 513,683,903,967,978,166,499,252,855,939,019,151
First ten multiples6,718,031, 13,436,062, 20,154,093, 26,872,124, 33,590,155, 40,308,186, 47,026,217, 53,744,248, 60,462,279, 67,180,310
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached68,020,07210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,718,031 → 20,154,094 → 10,077,047 → 30,231,142 → 15,115,571 → 45,346,714 → 22,673,357 → 68,020,072 → 34,010,036 → 17,005,018 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage671,803,100%
6,718,031% as a decimal67,180.31
6,718,031% of 1006,718,031
6,718,031% of 1,00067,180,310
As a fraction of 1006,718,031/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,718,031
Nerdulate something else
Nothing in mind? Surprise me · today’s page