Nerdulator> put something in

Recognised as Number

21,683

  • Positive
  • Odd
  • Prime
  • 5 digits

21,683 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value21,683
Digit count5
Digit sum20
Digit product288
Multiplicative persistence4times 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 factorisation21,683
Distinct prime factors121,683
Number of divisors2
Sum of divisors σ(n)21,684
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)21,682integers below n that share no factor with it
Carmichael function λ(n)21,682the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 21,6832 in total

Arithmetic

Previous number21,682
Next number21,684
Double43,366
Square root147.251485561≈irrational, shown to 9 decimal places
Cube root27.885158878≈
Negation-21,683
Reciprocal0.0000461191≈

Representations

Decimal21,683
Binary10101001011001115 bits
Octal52263
Hexadecimal54B3
Base 36GQB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-one thousand, six hundred and eighty-three
Ordinaltwenty-one thousand, six hundred and eighty-third
Scientific notation2.1683 × 10^4
Engineering notation21.683 × 10^3

In other bases

Ternary1002202002base 3; the most digit-efficient integer base after e: 10 digits
Quinary1143213base 5; one hand: 7 digits
Septenary120134base 7: 6 digits
Nonary32662base 9; each digit is two ternary digits: 5 digits
Duodecimal1066bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2e43base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:1:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1010T1T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010111110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0101010010110011
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
Bytes254 b3
Gray code111111011101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0101010010110011
32-bit00000000000000000101010010110011
64-bit0000000000000000000000000000000000000000000000000101010010110011
One's complement1010101101001100at 16 bits, every bit flipped
Bits reversed1100110100101010at 16 bits
Rotated left by 11010100101100110at 16 bits, wrapping
Shifted left by 11010100101100110= 43,366, no wrap
Shifted right by 110101001011001= 10,841, discarding the low bit
These bits as a double1.07128254 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime21,701+18
Previous prime21,673−10
Distance to nearest prime0, it is prime
Nearest square below21,609
Nearest square above21,904

Powers & multiples

21,683 to the power 2470,152,489
21,683 to the power 310,194,316,418,987
21,683 to the power 4221,043,362,912,895,121
21,683 to the power 54,792,883,238,040,304,908,643
First ten multiples21,683, 43,366, 65,049, 86,732, 108,415, 130,098, 151,781, 173,464, 195,147, 216,830
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 83

Collatz (3n + 1) trajectory

Steps to reach 1131the total stopping time
Highest value reached250,50411× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps21,683 → 65,050 → 32,525 → 97,576 → 48,788 → 24,394 → 12,197 → 36,592 → 18,296 → 9,148 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,168,300%
21,683% as a decimal216.83
21,683% of 10021,683
21,683% of 1,000216,830
As a fraction of 10021,683/100

Read another way

As bytes21.175 KiB
As a 24-bit colour#0054B3

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “21683” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.