Recognised as Number

20,827

Positive
Odd
Composite
5 digits

20,827 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value20,827

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 factorisation59 × 353

Distinct prime factors259, 353

Number of divisors4

Sum of divisors σ(n)21,240

Aliquot sum413sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)10,208the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,416

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

SquarefreeYesno repeated prime factor

All divisors1, 59, 353, 20,8274 in total

Arithmetic

Previous number20,826

Next number20,828

Double41,654

Half10,413.5

Square433,763,929

Cube9,034,001,349,283

Square root144.31562632≈irrational, shown to 9 decimal places

Cube root27.513271831≈

Negation-20,827

Reciprocal0.0000480146≈

Representations

Decimal20,827

Binary10100010101101115 bits

Octal50533

Hexadecimal515B

Base 36G2J

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

In wordstwenty thousand, eight hundred and twenty-seven

Ordinaltwenty thousand, eight hundred and twenty-seventh

Scientific notation2.0827 × 10^4

Engineering notation20.827 × 10^3

In other bases

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

Quinary1131302base 5; one hand: 7 digits

Septenary114502base 7: 6 digits

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

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

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

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

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

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

Bit-level

0101000101011011

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes251 5b

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

At each machine width

16-bit0101000101011011

32-bit00000000000000000101000101011011

64-bit0000000000000000000000000000000000000000000000000101000101011011

One's complement1010111010100100at 16 bits, every bit flipped

Bits reversed1101101010001010at 16 bits

Rotated left by 11010001010110110at 16 bits, wrapping

Shifted left by 11010001010110110= 41,654, no wrap

Shifted right by 110100010101101= 10,413, discarding the low bit

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

Nearest landmarks

Next prime20,849+22

Previous prime20,809−18

Distance to nearest prime18

Nearest square below20,736

Nearest square above21,025

Powers & multiples

20,827 to the power 2433,763,929

20,827 to the power 39,034,001,349,283

20,827 to the power 4188,151,146,101,517,041

20,827 to the power 53,918,623,919,856,295,412,907

First ten multiples20,827, 41,654, 62,481, 83,308, 104,135, 124,962, 145,789, 166,616, 187,443, 208,270

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 7

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1149the total stopping time

Highest value reached158,1647× the starting value

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

First steps20,827 → 62,482 → 31,241 → 93,724 → 46,862 → 23,431 → 70,294 → 35,147 → 105,442 → 52,721 → …

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

As a percentage & fraction

As a percentage2,082,700%

20,827% as a decimal208.27

20,827% of 10020,827

20,827% of 1,000208,270

As a fraction of 10020,827/100

Read another way

As seconds5 hours, 47 minutes and 7 seconds

As bytes20.339 KiB

As a 24-bit colour#00515B

Keep nerding

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