Nerdulator> put something in

Recognised as Number

20,363

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value20,363
Digit count5
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 2,909
Distinct prime factors27, 2,909
Number of divisors4
Sum of divisors σ(n)23,280
Aliquot sum2,917sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)17,448integers below n that share no factor with it
Carmichael function λ(n)8,724the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,448
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 2,909, 20,3634 in total

Arithmetic

Previous number20,362
Next number20,364
Double40,726
Square root142.698983879≈irrational, shown to 9 decimal places
Cube root27.307414786≈
Negation-20,363
Reciprocal0.0000491087≈

Representations

Decimal20,363
Binary10011111000101115 bits
Octal47613
Hexadecimal4F8B
Base 36FPN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty thousand, three hundred and sixty-three
Ordinaltwenty thousand, three hundred and sixty-third
Scientific notation2.0363 × 10^4
Engineering notation20.363 × 10^3

In other bases

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

Bit-level

0100111110001011
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes24f 8b
Gray code110100001001110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100111110001011
32-bit00000000000000000100111110001011
64-bit0000000000000000000000000000000000000000000000000100111110001011
One's complement1011000001110100at 16 bits, every bit flipped
Bits reversed1101000111110010at 16 bits
Rotated left by 11001111100010110at 16 bits, wrapping
Shifted left by 11001111100010110= 40,726, no wrap
Shifted right by 110011111000101= 10,181, discarding the low bit
These bits as a double1.00606587 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime20,369+6
Previous prime20,359−4
Distance to nearest prime4
Nearest square below20,164
Nearest square above20,449

Powers & multiples

20,363 to the power 2414,651,769
20,363 to the power 38,443,553,972,147
20,363 to the power 4171,936,089,534,829,361
20,363 to the power 53,501,134,591,197,730,278,043
First ten multiples20,363, 40,726, 61,089, 81,452, 101,815, 122,178, 142,541, 162,904, 183,267, 203,630
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 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63

Collatz (3n + 1) trajectory

Steps to reach 187the total stopping time
Highest value reached91,6364× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps20,363 → 61,090 → 30,545 → 91,636 → 45,818 → 22,909 → 68,728 → 34,364 → 17,182 → 8,591 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,036,300%
20,363% as a decimal203.63
20,363% of 10020,363
20,363% of 1,000203,630
As a fraction of 10020,363/100

Read another way

As bytes19.886 KiB
As a 24-bit colour#004F8B

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 “20363” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.