Nerdulator> put something in

Recognised as Number

19,827

  • Positive
  • Odd
  • Composite
  • 5 digits

19,827 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value19,827
Digit count5
Digit sum27
Digit product1,008
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 2,203
Distinct prime factors23, 2,203
Number of divisors6
Sum of divisors σ(n)28,652
Aliquot sum8,825sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)13,212integers below n that share no factor with it
Carmichael function λ(n)2,202the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,212
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 2,203, 6,609, 19,8276 in total

Arithmetic

Previous number19,826
Next number19,828
Double39,654
Square root140.808380432≈irrational, shown to 9 decimal places
Cube root27.065683701≈
Negation-19,827
Reciprocal0.0000504363≈

Representations

Decimal19,827
Binary10011010111001115 bits
Octal46563
Hexadecimal4D73
Base 36FAR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnineteen thousand, eight hundred and twenty-seven
Ordinalnineteen thousand, eight hundred and twenty-seventh
Scientific notation1.9827 × 10^4
Engineering notation19.827 × 10^3

In other bases

Ternary1000012100base 3; the most digit-efficient integer base after e: 10 digits
Quinary1113302base 5; one hand: 7 digits
Septenary111543base 7: 6 digits
Nonary30170base 9; each digit is two ternary digits: 5 digits
Duodecimalb583base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal29b7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:30:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10001TT100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0100110101110011
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
Bytes24d 73
Gray code110101111001010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100110101110011
32-bit00000000000000000100110101110011
64-bit0000000000000000000000000000000000000000000000000100110101110011
One's complement1011001010001100at 16 bits, every bit flipped
Bits reversed1100111010110010at 16 bits
Rotated left by 11001101011100110at 16 bits, wrapping
Shifted left by 11001101011100110= 39,654, no wrap
Shifted right by 110011010111001= 9,913, discarding the low bit
These bits as a double9.79583956 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime19,841+14
Previous prime19,819−8
Distance to nearest prime8
Nearest square below19,600
Nearest square above19,881

Powers & multiples

19,827 to the power 2393,109,929
19,827 to the power 37,794,190,562,283
19,827 to the power 4154,535,416,278,385,041
19,827 to the power 53,063,973,698,551,540,207,907
First ten multiples19,827, 39,654, 59,481, 79,308, 99,135, 118,962, 138,789, 158,616, 178,443, 198,270
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 148the total stopping time
Highest value reached89,2244× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps19,827 → 59,482 → 29,741 → 89,224 → 44,612 → 22,306 → 11,153 → 33,460 → 16,730 → 8,365 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,982,700%
19,827% as a decimal198.27
19,827% of 10019,827
19,827% of 1,000198,270
As a fraction of 10019,827/100

Read another way

As bytes19.362 KiB
As a 24-bit colour#004D73

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