Recognised as Number

20,690

Positive
Even
Composite
5 digits

20,690 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value20,690

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 2,069

Distinct prime factors32, 5, 2,069

Number of divisors8

Sum of divisors σ(n)37,260

Aliquot sum16,570sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,068the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,272

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 2,069, 4,138, 10,345, 20,6908 in total

Arithmetic

Previous number20,689

Next number20,691

Double41,380

Half10,345

Square428,076,100

Cube8,856,894,509,000

Square root143.840189099≈irrational, shown to 9 decimal places

Cube root27.452811636≈

Negation-20,690

Reciprocal0.0000483325≈

Representations

Decimal20,690

Binary10100001101001015 bits

Octal50322

Hexadecimal50D2

Base 36FYQ

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

In wordstwenty thousand, six hundred and ninety

Ordinaltwenty thousand, six hundred and ninetieth

Scientific notation2.069 × 10^4

Engineering notation20.69 × 10^3

In other bases

Ternary1001101022base 3; the most digit-efficient integer base after e: 10 digits

Quinary1130230base 5; one hand: 7 digits

Septenary114215base 7: 6 digits

Nonary31338base 9; each digit is two ternary digits: 5 digits

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

Vigesimal2beabase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal5:44:50base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0101000011010010

Bit length15 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes250 d2

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

At each machine width

16-bit0101000011010010

32-bit00000000000000000101000011010010

64-bit0000000000000000000000000000000000000000000000000101000011010010

One's complement1010111100101101at 16 bits, every bit flipped

Bits reversed0100101100001010at 16 bits

Rotated left by 11010000110100100at 16 bits, wrapping

Shifted left by 11010000110100100= 41,380, no wrap

Shifted right by 110100001101001= 10,345, discarding the low bit

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

Nearest landmarks

Next prime20,693+3

Previous prime20,681−9

Distance to nearest prime3

Nearest square below20,449

Nearest square above20,736

Powers & multiples

20,690 to the power 2428,076,100

20,690 to the power 38,856,894,509,000

20,690 to the power 4183,249,147,391,210,000

20,690 to the power 53,791,424,859,524,134,900,000

First ten multiples20,690, 41,380, 62,070, 82,760, 103,450, 124,140, 144,830, 165,520, 186,210, 206,900

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 5

Divisible by 8No, remainder 2

Divisible by 9No, remainder 8

Divisible by 10Yes

Divisible by 11No, remainder 10

Divisible by 12No, remainder 2

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 1149the total stopping time

Highest value reached78,5683× the starting value

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

First steps20,690 → 10,345 → 31,036 → 15,518 → 7,759 → 23,278 → 11,639 → 34,918 → 17,459 → 52,378 → …

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

As a percentage & fraction

As a percentage2,069,000%

20,690% as a decimal206.9

20,690% of 10020,690

20,690% of 1,000206,900

As a fraction of 10020,690/100

Read another way

As seconds5 hours, 44 minutes and 50 seconds

As bytes20.205 KiB

As a 24-bit colour#0050D2

Keep nerding

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