Nerdulator> put something in

Recognised as Number

6,713,671

  • Positive
  • Odd
  • Prime
  • 7 digits

6,713,671 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,713,671
Digit count7
Digit sum31
Digit product5,292
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,713,671
Distinct prime factors16,713,671
Number of divisors2
Sum of divisors σ(n)6,713,672
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,713,670integers below n that share no factor with it
Carmichael function λ(n)6,713,670the 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,6712 in total

Arithmetic

Previous number6,713,670
Next number6,713,672
Cube302,607,832,739,502,610,711
Square root2,591.075259424≈irrational, shown to 9 decimal places
Cube root188.648497975≈
Negation-6,713,671
Reciprocal1.48949807 × 10^-7≈

Representations

Decimal6,713,671
Binary1100110011100010100011123 bits
Octal31470507
Hexadecimal667147
Base 363ZWAV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and thirteen thousand, six hundred and seventy-one
Ordinalsix million, seven hundred and thirteen thousand, six hundred and seventy-first
Scientific notation6.713671 × 10^6
Engineering notation6.713671 × 10^6

In other bases

Ternary110122002102111base 3; the most digit-efficient integer base after e: 15 digits
Quinary3204314141base 5; one hand: 10 digits
Septenary111031246base 7: 9 digits
Nonary13562374base 9; each digit is two ternary digits: 8 digits
Duodecimal22b9287base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal21j43bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:4:54:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0T01T11T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110111011000101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000011001100111000101000111
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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 71 47
Gray code10101010100100111100100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000011001100111000101000111
64-bit0000000000000000000000000000000000000000011001100111000101000111
One's complement11111111100110011000111010111000at 32 bits, every bit flipped
Bits reversed11100010100011100110011000000000at 32 bits
Rotated left by 100000000110011001110001010001110at 32 bits, wrapping
Shifted left by 1110011001110001010001110= 13,427,342, no wrap
Shifted right by 11100110011100010100011= 3,356,835, discarding the low bit
These bits as a double3.3169942 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime6,713,683+12
Previous prime6,713,653−18
Distance to nearest prime0, it is prime
Nearest square below6,713,281
Nearest square above6,718,464

Powers & multiples

6,713,671 to the power 245,073,378,296,241
6,713,671 to the power 3302,607,832,739,502,610,711
6,713,671 to the power 42,031,609,431,036,049,231,954,730,081
6,713,671 to the power 513,639,557,320,473,223,683,146,744,657,637,351
First ten multiples6,713,671, 13,427,342, 20,141,013, 26,854,684, 33,568,355, 40,282,026, 46,995,697, 53,709,368, 60,423,039, 67,136,710
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 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1116the total stopping time
Highest value reached129,048,06419× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,713,671 → 20,141,014 → 10,070,507 → 30,211,522 → 15,105,761 → 45,317,284 → 22,658,642 → 11,329,321 → 33,987,964 → 16,993,982 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage671,367,100%
6,713,671% as a decimal67,136.71
6,713,671% of 1006,713,671
6,713,671% of 1,00067,136,710
As a fraction of 1006,713,671/100

Read another way

As bytes6.403 MiB
As a 24-bit colour#667147

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “6713671” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.