Recognised as Number

2,680,942

Positive
Even
Composite
7 digits

2,680,942 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value2,680,942

Digit count7

Digit sum31

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 11 × 31 × 3,931

Distinct prime factors42, 11, 31, 3,931

Number of divisors16

Sum of divisors σ(n)4,529,664

Aliquot sum1,848,722sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,179,000integers below n that share no factor with it

Carmichael function λ(n)3,930the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,179,000

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 11, 22, 31, 62, 341, 682, 3,931, 7,862, 43,241, 86,482, 121,861, 243,722, 1,340,471, 2,680,94216 in total

Arithmetic

Previous number2,680,941

Next number2,680,943

Double5,361,884

Half1,340,471

Square7,187,450,007,364

Cube19,269,136,597,642,456,888

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

Cube root138.919263709≈

Negation-2,680,942

Reciprocal3.73003221 × 10^-7≈

Representations

Decimal2,680,942

Binary101000111010000110111022 bits

Octal12164156

Hexadecimal28E86E

Base 361LGMM

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

In wordstwo million, six hundred and eighty thousand, nine hundred and forty-two

Ordinaltwo million, six hundred and eighty thousand, nine hundred and forty-second

Scientific notation2.680942 × 10^6

Engineering notation2.680942 × 10^6

In other bases

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

Quinary1141242232base 5; one hand: 10 digits

Septenary31534105base 7: 8 digits

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

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

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

Sexagesimal12:24:42:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001010001110100001101110

Bit length22 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits11within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes328 e8 6e

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

At each machine width

32-bit00000000001010001110100001101110

64-bit0000000000000000000000000000000000000000001010001110100001101110

One's complement11111111110101110001011110010001at 32 bits, every bit flipped

Bits reversed01110110000101110001010000000000at 32 bits

Rotated left by 100000000010100011101000011011100at 32 bits, wrapping

Shifted left by 110100011101000011011100= 5,361,884, no wrap

Shifted right by 1101000111010000110111= 1,340,471, discarding the low bit

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

Nearest landmarks

Next prime2,680,943+1

Previous prime2,680,907−35

Distance to nearest prime1

Nearest square below2,679,769

Nearest square above2,683,044

Powers & multiples

2,680,942 to the power 27,187,450,007,364

2,680,942 to the power 319,269,136,597,642,456,888

2,680,942 to the power 451,659,437,608,356,763,654,228,496

2,680,942 to the power 5138,495,955,980,623,198,664,694,652,523,232

First ten multiples2,680,942, 5,361,884, 8,042,826, 10,723,768, 13,404,710, 16,085,652, 18,766,594, 21,447,536, 24,128,478, 26,809,420

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8No, remainder 6

Divisible by 9No, remainder 4

Divisible by 10No, remainder 2

Divisible by 11Yes

Divisible by 12No, remainder 10

Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 1138the total stopping time

Highest value reached11,451,6164× the starting value

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

First steps2,680,942 → 1,340,471 → 4,021,414 → 2,010,707 → 6,032,122 → 3,016,061 → 9,048,184 → 4,524,092 → 2,262,046 → 1,131,023 → …

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

As a percentage & fraction

As a percentage268,094,200%

2,680,942% as a decimal26,809.42

2,680,942% of 1002,680,942

2,680,942% of 1,00026,809,420

As a fraction of 1002,680,942/100

Read another way

As seconds31 days, 42 minutes and 22 seconds

As bytes2.557 MiB

As a 24-bit colour#28E86E

Keep nerding

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