Nerdulator> put something in

Recognised as Number

19,831

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value19,831
Digit count5
Digit sum22
Digit product216
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 2,833
Distinct prime factors27, 2,833
Number of divisors4
Sum of divisors σ(n)22,672
Aliquot sum2,841sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)16,992integers below n that share no factor with it
Carmichael function λ(n)2,832the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,992
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 2,833, 19,8314 in total

Arithmetic

Previous number19,830
Next number19,832
Double39,662
Square root140.822583416≈irrational, shown to 9 decimal places
Cube root27.067503702≈
Negation-19,831
Reciprocal0.0000504261≈

Representations

Decimal19,831
Binary10011010111011115 bits
Octal46567
Hexadecimal4D77
Base 36FAV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnineteen thousand, eight hundred and thirty-one
Ordinalnineteen thousand, eight hundred and thirty-first
Scientific notation1.9831 × 10^4
Engineering notation19.831 × 10^3

In other bases

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

Bit-level

0100110101110111
Bit length15 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits5within that length
Bit parityeven10 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
Bytes24d 77
Gray code110101111001100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100110101110111
32-bit00000000000000000100110101110111
64-bit0000000000000000000000000000000000000000000000000100110101110111
One's complement1011001010001000at 16 bits, every bit flipped
Bits reversed1110111010110010at 16 bits
Rotated left by 11001101011101110at 16 bits, wrapping
Shifted left by 11001101011101110= 39,662, no wrap
Shifted right by 110011010111011= 9,915, discarding the low bit
These bits as a double9.79781582 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime19,841+10
Previous prime19,819−12
Distance to nearest prime10
Nearest square below19,600
Nearest square above19,881

Powers & multiples

19,831 to the power 2393,268,561
19,831 to the power 37,798,908,833,191
19,831 to the power 4154,660,161,071,010,721
19,831 to the power 53,067,065,654,199,213,608,151
First ten multiples19,831, 39,662, 59,493, 79,324, 99,155, 118,986, 138,817, 158,648, 178,479, 198,310
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 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 148the total stopping time
Highest value reached133,8646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps19,831 → 59,494 → 29,747 → 89,242 → 44,621 → 133,864 → 66,932 → 33,466 → 16,733 → 50,200 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,983,100%
19,831% as a decimal198.31
19,831% of 10019,831
19,831% of 1,000198,310
As a fraction of 10019,831/100

Read another way

As bytes19.366 KiB
As a 24-bit colour#004D77

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