Recognised as Number
6,713,131
- Positive
- Odd
- Composite
- 7 digits
6,713,131 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value6,713,131
Digit count7
Digit sum22
Digit product378
Multiplicative persistence5times 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 factorisation797 × 8,423
Distinct prime factors2797, 8,423
Number of divisors4
Sum of divisors σ(n)6,722,352
Aliquot sum9,221sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,703,912integers below n that share no factor with it
Carmichael function λ(n)3,351,956the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,703,912
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 797, 8,423, 6,713,1314 in total
Arithmetic
Previous number6,713,130
Next number6,713,132
Double13,426,262
Half3,356,565.5
Square45,066,127,823,161
Cube302,534,819,739,624,627,091
Square root2,590.971053486≈irrational, shown to 9 decimal places
Cube root188.643439991≈
Negation-6,713,131
Reciprocal1.48961788 × 10^-7≈
Representations
Decimal6,713,131
Binary1100110011011110010101123 bits
Octal31467453
Hexadecimal666F2B
Base 363ZVVV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and thirteen thousand, one hundred and thirty-one
Ordinalsix million, seven hundred and thirteen thousand, one hundred and thirty-first
Scientific notation6.713131 × 10^6
Engineering notation6.713131 × 10^6
In other bases
Ternary110122001200111base 3; the most digit-efficient integer base after e: 15 digits
Quinary3204310011base 5; one hand: 10 digits
Septenary111026545base 7: 9 digits
Nonary13561614base 9; each digit is two ternary digits: 8 digits
Duodecimal22b8ab7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal21j2gbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:4:45:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0T01TT00111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110111011001101111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001100110111100101011
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
Bytes366 6f 2b
Gray code10101010101100010111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001100110111100101011
64-bit0000000000000000000000000000000000000000011001100110111100101011
One's complement11111111100110011001000011010100at 32 bits, every bit flipped
Bits reversed11010100111101100110011000000000at 32 bits
Rotated left by 100000000110011001101111001010110at 32 bits, wrapping
Shifted left by 1110011001101111001010110= 13,426,262, no wrap
Shifted right by 11100110011011110010101= 3,356,565, discarding the low bit
These bits as a double3.3167274 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,713,131 to the power 245,066,127,823,161
6,713,131 to the power 3302,534,819,739,624,627,091
6,713,131 to the power 42,030,955,876,973,486,012,488,031,921
6,713,131 to the power 513,634,072,857,342,895,128,499,794,217,854,651
First ten multiples6,713,131, 13,426,262, 20,139,393, 26,852,524, 33,565,655, 40,278,786, 46,991,917, 53,705,048, 60,418,179, 67,131,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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 159the total stopping time
Highest value reached30,209,0924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,713,131 → 20,139,394 → 10,069,697 → 30,209,092 → 15,104,546 → 7,552,273 → 22,656,820 → 11,328,410 → 5,664,205 → 16,992,616 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage671,313,100%
6,713,131% as a decimal67,131.31
6,713,131% of 1006,713,131
6,713,131% of 1,00067,131,310
As a fraction of 1006,713,131/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,713,131
Nerdulate something else
Nothing in mind? Surprise me · today’s page