Recognised as Number
6,713,129
- Positive
- Odd
- Prime
- 7 digits
6,713,129 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,713,129
Digit count7
Digit sum29
Digit product2,268
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,713,129
Distinct prime factors16,713,129
Number of divisors2
Sum of divisors σ(n)6,713,130
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,713,128integers below n that share no factor with it
Carmichael function λ(n)6,713,128the 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,713,1292 in total
Arithmetic
Previous number6,713,128
Next number6,713,130
Double13,426,258
Half3,356,564.5
Square45,066,100,970,641
Cube302,534,549,342,938,245,689
Square root2,590.97066753≈irrational, shown to 9 decimal places
Cube root188.643421257≈
Negation-6,713,129
Reciprocal1.48961833 × 10^-7≈
Representations
Decimal6,713,129
Binary1100110011011110010100123 bits
Octal31467451
Hexadecimal666F29
Base 363ZVVT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and thirteen thousand, one hundred and twenty-nine
Ordinalsix million, seven hundred and thirteen thousand, one hundred and twenty-ninth
Scientific notation6.713129 × 10^6
Engineering notation6.713129 × 10^6
In other bases
Ternary110122001200102base 3; the most digit-efficient integer base after e: 15 digits
Quinary3204310004base 5; one hand: 10 digits
Septenary111026543base 7: 9 digits
Nonary13561612base 9; each digit is two ternary digits: 8 digits
Duodecimal22b8ab5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal21j2g9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:4:45:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0T01TT0011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110111011001101111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001100110111100101001
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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 6f 29
Gray code10101010101100010111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001100110111100101001
64-bit0000000000000000000000000000000000000000011001100110111100101001
One's complement11111111100110011001000011010110at 32 bits, every bit flipped
Bits reversed10010100111101100110011000000000at 32 bits
Rotated left by 100000000110011001101111001010010at 32 bits, wrapping
Shifted left by 1110011001101111001010010= 13,426,258, no wrap
Shifted right by 11100110011011110010100= 3,356,564, discarding the low bit
These bits as a double3.31672642 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,713,129 to the power 245,066,100,970,641
6,713,129 to the power 3302,534,549,342,938,245,689
6,713,129 to the power 42,030,953,456,696,009,682,343,950,881
6,713,129 to the power 513,634,052,547,796,226,782,823,964,633,816,649
First ten multiples6,713,129, 13,426,258, 20,139,387, 26,852,516, 33,565,645, 40,278,774, 46,991,903, 53,705,032, 60,418,161, 67,131,290
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1116the total stopping time
Highest value reached76,466,75211× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,713,129 → 20,139,388 → 10,069,694 → 5,034,847 → 15,104,542 → 7,552,271 → 22,656,814 → 11,328,407 → 33,985,222 → 16,992,611 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage671,312,900%
6,713,129% as a decimal67,131.29
6,713,129% of 1006,713,129
6,713,129% of 1,00067,131,290
As a fraction of 1006,713,129/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,129
Nerdulate something else
Nothing in mind? Surprise me · today’s page