Nerdulator> put something in

Recognised as Number

20,204

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value20,204
Digit count5
Digit sum8
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^2 × 5,051
Distinct prime factors22, 5,051
Number of divisors6
Sum of divisors σ(n)35,364
Aliquot sum15,160sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)10,100integers below n that share no factor with it
Carmichael function λ(n)5,050the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,100
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5,051, 10,102, 20,2046 in total

Arithmetic

Previous number20,203
Next number20,205
Double40,408
Half10,102
Square root142.14077529≈irrational, shown to 9 decimal places
Cube root27.236154344≈
Negation-20,204
Reciprocal0.0000494951≈

Representations

Decimal20,204
Binary10011101110110015 bits
Octal47354
Hexadecimal4EEC
Base 36FL8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty thousand, two hundred and four
Ordinaltwenty thousand, two hundred and fourth
Scientific notation2.0204 × 10^4
Engineering notation20.204 × 10^3

In other bases

Ternary1000201022base 3; the most digit-efficient integer base after e: 10 digits
Quinary1121304base 5; one hand: 7 digits
Septenary112622base 7: 6 digits
Nonary30638base 9; each digit is two ternary digits: 5 digits
Duodecimalb838base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal2aa4base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:36:44base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1001T0110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001100111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0100111011101100
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 even
Highest set bitbit 14worth 16,384
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes24e ec
Gray code110100110011010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100111011101100
32-bit00000000000000000100111011101100
64-bit0000000000000000000000000000000000000000000000000100111011101100
One's complement1011000100010011at 16 bits, every bit flipped
Bits reversed0011011101110010at 16 bits
Rotated left by 11001110111011000at 16 bits, wrapping
Shifted left by 11001110111011000= 40,408, no wrap
Shifted right by 110011101110110= 10,102, discarding the low bit
These bits as a double9.98210231 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime20,219+15
Previous prime20,201−3
Distance to nearest prime3
Nearest square below20,164
Nearest square above20,449

Powers & multiples

20,204 to the power 2408,201,616
20,204 to the power 38,247,305,449,664
20,204 to the power 4166,628,559,305,011,456
20,204 to the power 53,366,563,412,198,451,457,024
First ten multiples20,204, 40,408, 60,612, 80,816, 101,020, 121,224, 141,428, 161,632, 181,836, 202,040
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 187the total stopping time
Highest value reached25,5761× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps20,204 → 10,102 → 5,051 → 15,154 → 7,577 → 22,732 → 11,366 → 5,683 → 17,050 → 8,525 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,020,400%
20,204% as a decimal202.04
20,204% of 10020,204
20,204% of 1,000202,040
As a fraction of 10020,204/100

Read another way

As bytes19.73 KiB
As a 24-bit colour#004EEC

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