Nerdulator> put something in

Recognised as Number

2,097,713

  • Positive
  • Odd
  • Prime
  • 7 digits

2,097,713 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 value2,097,713
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2,097,713
Distinct prime factors12,097,713
Number of divisors2
Sum of divisors σ(n)2,097,714
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,097,712integers below n that share no factor with it
Carmichael function λ(n)2,097,712the 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, 2,097,7132 in total

Arithmetic

Previous number2,097,712
Next number2,097,714
Double4,195,426
Cube9,230,775,929,362,846,097
Square root1,448.348369696≈irrational, shown to 9 decimal places
Cube root128.011412557≈
Negation-2,097,713
Reciprocal4.76709636 × 10^-7≈

Representations

Decimal2,097,713
Binary100000000000100011000122 bits
Octal10001061
Hexadecimal200231
Base 3618YLT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, ninety-seven thousand, seven hundred and thirteen
Ordinaltwo million, ninety-seven thousand, seven hundred and thirteenth
Scientific notation2.097713 × 10^6
Engineering notation2.097713 × 10^6

In other bases

Ternary10221120112002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1014111323base 5; one hand: 10 digits
Septenary23554532base 7: 8 digits
Nonary3846462base 9; each digit is two ternary digits: 7 digits
Duodecimal851b55base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald245dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:42:41:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100TTT1TTT01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000000011001110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000000000001000110001
Bit length22 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits17within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes320 02 31
Gray code1100000000001100101001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000000000001000110001
64-bit0000000000000000000000000000000000000000001000000000001000110001
One's complement11111111110111111111110111001110at 32 bits, every bit flipped
Bits reversed10001100010000000000010000000000at 32 bits
Rotated left by 100000000010000000000010001100010at 32 bits, wrapping
Shifted left by 110000000000010001100010= 4,195,426, no wrap
Shifted right by 1100000000000100011000= 1,048,856, discarding the low bit
These bits as a double1.03640793 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,097,727+14
Previous prime2,097,709−4
Distance to nearest prime0, it is prime
Nearest square below2,096,704
Nearest square above2,099,601

Powers & multiples

2,097,713 to the power 24,400,399,830,369
2,097,713 to the power 39,230,775,929,362,846,097
2,097,713 to the power 419,363,518,667,111,523,974,676,161
2,097,713 to the power 540,619,104,833,742,516,291,489,853,719,793
First ten multiples2,097,713, 4,195,426, 6,293,139, 8,390,852, 10,488,565, 12,586,278, 14,683,991, 16,781,704, 18,879,417, 20,977,130
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1104the total stopping time
Highest value reached6,293,1403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,097,713 → 6,293,140 → 3,146,570 → 1,573,285 → 4,719,856 → 2,359,928 → 1,179,964 → 589,982 → 294,991 → 884,974 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage209,771,300%
2,097,713% as a decimal20,977.13
2,097,713% of 1002,097,713
2,097,713% of 1,00020,977,130
As a fraction of 1002,097,713/100

Read another way

As bytes2.001 MiB
As a 24-bit colour#200231

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 “2097713” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.