Recognised as Number

2,097,560

Positive
Even
Composite
7 digits

2,097,560 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value2,097,560

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 numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 5 × 41 × 1,279

Distinct prime factors42, 5, 41, 1,279

Number of divisors32

Sum of divisors σ(n)4,838,400

Aliquot sum2,740,840sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)817,920integers below n that share no factor with it

Carmichael function λ(n)25,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 817,920

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 8, 10, 20, 40, 41, 82, 164, 205, 328, 410, 820, 1,279, 1,640, 2,558, 5,116, 6,395, 10,232, 12,790, 25,580, 51,160, 52,439, 104,878, 209,756, 262,195, 419,512, 524,390, 1,048,780, 2,097,56032 in total

Arithmetic

Previous number2,097,559

Next number2,097,561

Double4,195,120

Half1,048,780

Square4,399,757,953,600

Cube9,228,756,293,153,216,000

Square root1,448.295549948≈irrational, shown to 9 decimal places

Cube root128.008300243≈

Negation-2,097,560

Reciprocal4.76744408 × 10^-7≈

Representations

Decimal2,097,560

Binary100000000000011001100022 bits

Octal10000630

Hexadecimal200198

Base 3618YHK

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwo million, ninety-seven thousand, five hundred and sixty

Ordinaltwo million, ninety-seven thousand, five hundred and sixtieth

Scientific notation2.09756 × 10^6

Engineering notation2.09756 × 10^6

In other bases

Ternary10221120022102base 3; the most digit-efficient integer base after e: 14 digits

Quinary1014110220base 5; one hand: 10 digits

Septenary23554223base 7: 8 digits

Nonary3846272base 9; each digit is two ternary digits: 7 digits

Duodecimal851a48base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimald23i0base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal9:42:39:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1100TTT010T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11000000000011011101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000000000000110011000

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 even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes320 01 98

Gray code1100000000000101010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000000000000110011000

64-bit0000000000000000000000000000000000000000001000000000000110011000

One's complement11111111110111111111111001100111at 32 bits, every bit flipped

Bits reversed00011001100000000000010000000000at 32 bits

Rotated left by 100000000010000000000001100110000at 32 bits, wrapping

Shifted left by 110000000000001100110000= 4,195,120, no wrap

Shifted right by 1100000000000011001100= 1,048,780, discarding the low bit

These bits as a double1.03633234 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,097,593+33

Previous prime2,097,559−1

Distance to nearest prime1

Nearest square below2,096,704

Nearest square above2,099,601

Powers & multiples

2,097,560 to the power 24,399,757,953,600

2,097,560 to the power 39,228,756,293,153,216,000

2,097,560 to the power 419,357,870,050,266,459,752,960,000

2,097,560 to the power 540,604,293,902,636,915,319,418,777,600,000

First ten multiples2,097,560, 4,195,120, 6,292,680, 8,390,240, 10,487,800, 12,585,360, 14,682,920, 16,780,480, 18,878,040, 20,975,600

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 8

Divisible by 100No, remainder 60

Collatz (3n + 1) trajectory

Steps to reach 1104the total stopping time

Highest value reached2,097,560

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps2,097,560 → 1,048,780 → 524,390 → 262,195 → 786,586 → 393,293 → 1,179,880 → 589,940 → 294,970 → 147,485 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage209,756,000%

2,097,560% as a decimal20,975.6

2,097,560% of 1002,097,560

2,097,560% of 1,00020,975,600

As a fraction of 1002,097,560/100

Read another way

As seconds24 days, 6 hours and 39 minutes

As bytes2 MiB

As a 24-bit colour#200198

Keep nerding

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