Recognised as Number

20,692

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value20,692

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 7 × 739

Distinct prime factors32, 7, 739

Number of divisors12

Sum of divisors σ(n)41,440

Aliquot sum20,748sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 7, 14, 28, 739, 1,478, 2,956, 5,173, 10,346, 20,69212 in total

Arithmetic

Previous number20,691

Next number20,693

Double41,384

Half10,346

Square428,158,864

Cube8,859,463,213,888

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

Cube root27.453696183≈

Negation-20,692

Reciprocal0.0000483279≈

Representations

Decimal20,692

Binary10100001101010015 bits

Octal50324

Hexadecimal50D4

Base 36FYS

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

In wordstwenty thousand, six hundred and ninety-two

Ordinaltwenty thousand, six hundred and ninety-second

Scientific notation2.0692 × 10^4

Engineering notation20.692 × 10^3

In other bases

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

Quinary1130232base 5; one hand: 7 digits

Septenary114220base 7: 6 digits

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

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

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

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

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

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

Bit-level

0101000011010100

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 22 trailing zeros

Power of twoNo

Bytes250 d4

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

At each machine width

16-bit0101000011010100

32-bit00000000000000000101000011010100

64-bit0000000000000000000000000000000000000000000000000101000011010100

One's complement1010111100101011at 16 bits, every bit flipped

Bits reversed0010101100001010at 16 bits

Rotated left by 11010000110101000at 16 bits, wrapping

Shifted left by 11010000110101000= 41,384, no wrap

Shifted right by 110100001101010= 10,346, discarding the low bit

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

Nearest landmarks

Next prime20,693+1

Previous prime20,681−11

Distance to nearest prime1

Nearest square below20,449

Nearest square above20,736

Powers & multiples

20,692 to the power 2428,158,864

20,692 to the power 38,859,463,213,888

20,692 to the power 4183,320,012,821,770,496

20,692 to the power 53,793,257,705,308,075,103,232

First ten multiples20,692, 41,384, 62,076, 82,768, 103,460, 124,152, 144,844, 165,536, 186,228, 206,920

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7Yes

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10No, remainder 2

Divisible by 11No, remainder 1

Divisible by 12No, remainder 4

Divisible by 100No, remainder 92

Collatz (3n + 1) trajectory

Steps to reach 1105the total stopping time

Highest value reached20,692

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

First steps20,692 → 10,346 → 5,173 → 15,520 → 7,760 → 3,880 → 1,940 → 970 → 485 → 1,456 → …

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

As a percentage & fraction

As a percentage2,069,200%

20,692% as a decimal206.92

20,692% of 10020,692

20,692% of 1,000206,920

As a fraction of 10020,692/100

Read another way

As seconds5 hours, 44 minutes and 52 seconds

As bytes20.207 KiB

As a 24-bit colour#0050D4

Keep nerding

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